Optimization techniques in graph theory, groups, and combinatorics. Applications to networks, algorithms, and communication protocols
Total activity: 19
Type of activity
MIN DE ECONOMIA Y COMPETITIVIDAD
Funding entity code
Extremal problems in Combinatorics and Graph Theory deal with the study of discrete configurations, which optimize one or several parameters. In this framework, the project includes problems related to the optimization of metric parameters of graphs, to coloring and labeling problems, to connectivity and reliability, isoperimetric problems, to configurations in finite geometries, to symmetric structures, to tilings, to algorithm design and its computational complexity, and to signal processing techniques. All these problems are connected in the framework of the project and are mainly motivated by applications in network design and analysis for communication and multiprocessor systems. In particular, the project considers applications to the study of complex networks and their communication protocols. The project aims at developing applications to these optimization problems of algebraic techniques and of spectral analysis (adjacency and Laplacian matrices), Fourier analysis in Abelian groups and polynomial and probabilistic methods in combinatorics. These techniques complement the combinatorial methods close to the combinatorial nature of the problems under consideration. This project gathers the activity of a well-established research group with almost 30 years of experience and with international projection. Its objectives are inserted into European projects the research group is involved with.
Barriere, E.; Comellas, F.; Dalfo, C.; Fiol, M. Journal of physics A. Mathematical and theoretical Vol. 49, num. 22, p. 1-19 DOI: 10.1088/1751-8113/49/22/225202 Date of publication: 2016 Journal article