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

  • 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 ...
  • Symmetry breaking in tournaments 

    Lozano Bojados, Antoni (2013-03-24)
    Article
    Accés obert
    We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S in V(T) is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex ...
  • Abelian Cayley digraphs with asymptotically large order for any given degree 

    Aguiló Gost, Francisco de Asis L.; Fiol Mora, Miquel Àngel; Pérez Mansilla, Sonia (2016-04-29)
    Article
    Accés obert
    Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congruence in Z. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, ...
  • Sequence mixed graphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López, Nacho (2016-12)
    Article
    Accés obert
    A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and literated line ...
  • Connected and internal graph searching 

    Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
    Report de recerca
    Accés obert
    This paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs. It ...
  • Confección y gestión automática de exámenes tipo test 

    Cañadas Lorenzo, Juan Carlos; Diego Vives, José Antonio; Pelayo Melero, Ignacio Manuel (Universidad de Cádiz, 2016)
    Comunicació de congrés
    Accés restringit per política de l'editorial
    El presente trabajo describe la implementación de una aplicación informática como recurso docente, diseñada como plataforma para la elaboración, utilización y corrección de controles formativos y exámenes de evaluación. ...
  • General bounds on limited broadcast domination 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
    Report de recerca
    Accés obert
    Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ...

Mostra'n més