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

Envíos recientes

  • Revisiting Kneser’s theorem for field extensions 

    Bachoc, Christine; Serra Albó, Oriol; Zemor, Gilles (2017-05-31)
    Artículo
    Acceso restringido por política de la editorial
    A Theorem of Hou, Leung and Xiang generalised Kneser’s addition Theorem to field extensions. This theorem was known to be valid only in separable extensions, and it was a conjecture of Hou that it should be valid for all ...
  • Transformation and decomposition of clutters into matroids 

    Martí Farré, Jaume; Mier Vinué, Anna de (2017-05-25)
    Artículo
    Acceso restringido por política de la editorial
    A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of bases, and its set of hyperplanes are examples of clutters arising from matroids. In this paper we address the question of ...
  • Random subgraphs make identification affordable 

    Foucaud, Florent; Perarnau, Guillem; Serra Albó, Oriol (2017-01-02)
    Artículo
    Acceso abierto
    An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the ...
  • On star forest ascending subgraph decomposition 

    Aroca Farrerons, José María; Lladó Sánchez, Ana M. (2017-02-03)
    Artículo
    Acceso abierto
    The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with (n+12) edges admits an edge decomposition G=H1¿¿¿Hn such that Hi has i edges and it is isomorphic to a subgraph of Hi+1, i=1,…,n-1. We ...
  • Approximate results for rainbow labelings 

    Lladó Sánchez, Ana M.; Miller, Mirka (2017-03)
    Artículo
    Acceso restringido por política de la editorial
    A simple graph G=(V,E) is said to be antimagic if there exists a bijection f:E¿[1,|E|] such that the sum of the values of f on edges incident to a vertex takes different values on distinct vertices. The graph G is distance ...
  • Proinsulin protects against age-related cognitive loss through anti-inflammatory convergent pathways 

    Corpas, Ruben; Hernández Pinto, Alberto M.; Porquet, David; Hernández Sánchez, Catalina; Bosch, Fatima; Ortega Aznar, Arantxa; Comellas Padró, Francesc de Paula; de la Rosa, Enrique J.; Sanfeliu Pujol, Coral (2017-09-01)
    Artículo
    Acceso restringido por política de la editorial
    Brain inflammaging is increasingly considered as contributing to age-related cognitive loss and neurodegeneration. Despite intensive research in multiple models, no clinically effective pharmacological treatment has been ...
  • (Di)graph products, labelings and related results 

    López Masip, Susana Clara (2017-07)
    Artículo
    Acceso restringido por política de la editorial
    Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can ...
  • On subsets of the normal rational curve 

    Ball, Simeon Michael; De Beule, Jan (2017-06-01)
    Artículo
    Acceso restringido por política de la editorial
    A normal rational curve of the (k-1) -dimensional projective space over Fq is an arc of size q+1 , since any k points of the curve span the whole space. In this paper, we will prove that if q is odd, then a subset of size ...
  • Counting configuration-free sets in groups 

    Rué Perna, Juan José; Serra Albó, Oriol; Vena Cros, Lluís (2017-01-01)
    Artículo
    Acceso restringido por política de la editorial
    © 2017 Elsevier Ltd. We provide asymptotic counting for the number of subsets of given size which are free of certain configurations in finite groups. Applications include sets without solutions to equations in non-abelian ...
  • Characterizing path-like trees from linear configurations 

    López Masip, Susana Clara (2017)
    Comunicación de congreso
    Acceso abierto
    Assume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, ...
  • Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree 

    Cano Vila, María del Pilar; Perarnau Llobet, Guillem; Serra Albó, Oriol (2017-08-01)
    Artículo
    Acceso restringido por política de la editorial
    We study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge–colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of ...
  • On sets defining few ordinary planes 

    Ball, Simeon Michael (2017-09-19)
    Artículo
    Acceso restringido por política de la editorial
    Let S be a set of n points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of S is less than (Formula presented.) for some ...

Muestra más