L'objectiu principal de la línia de recerca és l'aplicació de la teoria de grafs i les estructures combinatòries en general al disseny i l?anàlisi de xarxes d'interconnexió. En aquest objectiu hi conflueixen tècniques de teoria de grafs, combinatòria algebraica i enumerativa, optimització combinatòria, algorísmica, estructures aleatòries i geometria discreta. Els temes bàsics de treball són el disseny de topologies per a xarxes d'interconnexió, l'estudi de la seva fiabilitat i vulnerabilitat, algorismes d'encaminament i de difusió de la informació en xarxes, anàlisi de xarxes simètriques i esquemes d'emmagatzemament de dades en arquitectures paral·leles i sistemes informàtics distribuïts.

http://futur.upc.edu/COMBGRAF

The research group has a wide range of interests including Extremal P^roblems in Combinatorics and Graph Theory, Algebraic Graph Theory, Additive Combinatorics, Graph coloring, Graph labelings and decompositions, Combinatorial Geometry, Geomteric and Combinatorial Group Theory or Complex Networks. One of the main applications is focuissed on the study and design of interconnection networks, including characteristic parameters (diameter, connectivity), communication algorithms and large social, biological and data networks.

http://futur.upc.edu/COMBGRAF

The research group has a wide range of interests including Extremal P^roblems in Combinatorics and Graph Theory, Algebraic Graph Theory, Additive Combinatorics, Graph coloring, Graph labelings and decompositions, Combinatorial Geometry, Geomteric and Combinatorial Group Theory or Complex Networks. One of the main applications is focuissed on the study and design of interconnection networks, including characteristic parameters (diameter, connectivity), communication algorithms and large social, biological and data networks.

http://futur.upc.edu/COMBGRAF

Enviaments recents

  • The conjugacy problem in extensions of Thompson's group F 

    Burillo Puig, José; Matucci, Francesco; Ventura Capell, Enric (2016-10-01)
    Article
    Accés restringit per política de l'editorial
    We solve the twisted conjugacy problem on Thompson’s group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut+(F) are orbit decidable provided a certain conjecture on Thompson’s ...
  • Digraphs with walks of equal length between vertices 

    Fiol Mora, Miquel Àngel; Alegre, Ignasi; Andrés Yebra, José Luís; Fàbrega Canudas, José (1984)
    Text en actes de congrés
    Accés obert
  • Correlation among runners and some results on the lonely runner conjecture 

    Perarnau, Guillem; Serra Albó, Oriol (2016-10-03)
    Article
    Accés obert
    The Lonely Runner Conjecture, posed independently by Wills and by Cusick, states that for any set of runners running along the unit circle with constant different speeds and starting at the same point, there is a time where ...
  • Rainbow perfect matchings in r-partite graph structures 

    Cano Vila, María del Pilar; Perarnau, Guillem; Serra Albó, Oriol (2016-10-03)
    Article
    Accés restringit per política de l'editorial
    A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite ...
  • A geometric approach to dense Cayley digraphs of finite Abelian groups 

    Aguiló Gost, Francisco de Asis L.; Fiol Mora, Miquel Àngel; Pérez Mansilla, Sonia (2016)
    Article
    Accés restringit per política de l'editorial
    We give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related minimum distance diagrams. ...
  • Perspectivas en combinatoria 

    Noy Serrano, Marcos; Serra Albó, Oriol (Real Sociedad Matemática Española, 2016-10-03)
    Article
    Accés obert
  • Classifing stars: a comparison between clasical, genetic and neural network algorithms 

    Hernández Pajares, Manuel; Comellas Padró, Francesc de Paula; Monte Moreno, Enrique (F. MURTAGH AND A. HECK, 1992)
    Text en actes de congrés
    Accés obert
  • Some spectral and quasi-spectral characterizations of distance-regular graphs 

    Abiad, Aida; Van Dam, Edwin R; Fiol Mora, Miquel Àngel (2016-10-01)
    Article
    Accés restringit per política de l'editorial
    In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular ...
  • The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues 

    Fiol Mora, Miquel Àngel (2016-06-01)
    Article
    Accés restringit per política de l'editorial
    Let Gamma be a distance-regular graph with diameter d and Kneser graph K = Gamma(d), the distance-d graph of Gamma. We say that Gamma is partially antipodal when K has fewer distinct eigenvalues than Gamma. In particular, ...
  • Fast calculation of entropy with Zhang's estimator 

    Lozano Bojados, Antoni; Casas Fernández, Bernardino; Bentz, Chris; Ferrer Cancho, Ramon (RAM - Verlag, 2016-12-01)
    Capítol de llibre
    Accés restringit per política de l'editorial
    Entropy is a fundamental property of a repertoire. Here, we present an efficient algorithm to estimate the entropy of types with the help of Zhang’s estimator. The algorithm takes advantage of the fact that the number of ...

Mostra'n més