Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 129 results
  • Connectivity: properties and structure

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2013-12-05
    Book chapter

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Connectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, such as Menger¿s theorems. In these theorems, one condition which is clearly necessary also turns out to be sufficient. Moreover, these results are closely related to some other key theorems in graph theory: Ford and Fulkerson¿s theorem about flows and Hall¿s theorem on perfect matchings. With respect to the applications, the study of connectivity parameters of graphs and digraphs is of great interest in the design of reliable and fault-tolerant interconnection or communication networks. Since graph connectivity has been so widely studied, we limit ourselves here to the presentation of some of the key results dealing with finite simple graphs and digraphs. For results about infinite graphs and connectivity algorithms the reader can consult, for instance, Aharoni and Diestel [AhDi94], Gibbons [Gi85], Halin [Ha00], Henzinger, Rao, and Gabow [HeRaGa00], Wigderson [Wi92]. For further details, we refer the reader to some of the good textbooks and surveys available on the subject: Berge [Be76], Bermond, Homobono, and Peyrat [BeHoPe89], Frank [Fr90, Fr94, Fr95], Gross and Yellen [GrYe06], Hellwig and Volkmann [HeVo08], Lov ´asz [Lo93], Mader [Ma79], Oellermann [Oe96], Tutte [Tu66].

  • Further topics in connectivity

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2013-12-05
    Book chapter

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results concerning maximal (vertex- or edge-) connectivity. Next, we deal with conditions for having (usually lower) bounds for the connectivity parameters. Finally, some other general connectivity measures, such as one instance of the so-called ¿conditional connectivity,¿ are considered. For unexplained terminology concerning connectivity, see §4.1.

  • Adaptive bit loading in FHT-based OFDM transponders for flexi-grid optical networks

     Vila Nadal, Laia; Svaluto Moreolo, Michela; Fàbrega Canudas, Josep; Junyent Giralt, Gabriel
    International Conference on Transparent Optical Networks
    Presentation's date: 2013
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In this paper, we propose to use adaptive bit loading (BL) in OFDM transponders based on the fast Hartley transform (FHT) for flexi-grid optical networks. A direct-detection (DD) optical system is implemented and a double-side band (DSB) signal with reduced guard band is transmitted for cost-sensitive applications. Different bit loading schemes are analysed to obtain a net data rate of 10 Gb/s for a maximum link of 120 km, occupying only one slot of 12.5 GHz or two slots of 6.25 GHz, according to the proposed spectrum sliced optical path network (SLICE) architecture.

  • From clutters to matroids

     Fàbrega Canudas, Josep; Martí Farré, Jaume; Muñoz Lopez, Francisco Javier
    Encuentro Andaluz de Matemática Discreta
    Presentation's date: 2013-10-17
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    This paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion minimal subsets of the family into the set of circuits of a matroid.

  • Bandwidth variable transponders based on OFDM technology for elastic optical networks

     Svaluto Moreolo, Michela; Fàbrega Canudas, Josep; Vila Nadal, Laia; Vilchez, Francisco Javier; Junyent Giralt, Gabriel
    International Conference on Transparent Optical Networks
    Presentation's date: 2013
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    n this paper, the flexible features of bandwidth variable transponders based on OFDM technology are investigated. The limiting factors due to the subsystem components and the trade-off between cost-effectiveness, capacity and reach are taken into account for designing this fundamental building block of elastic optical networks. Advanced functionalities, including sliceability, are discussed. Performance is analysed by means of numerical simulations. Furthermore, the experimental results, achieved within the EOS platform (Experimental platform for Optical OFDM Systems) of the ADRENALINE testbed, are presented.

  • On the Structure of Graphs without Short Cycles  Open access

     Salas Piñon, Julian
    Defense's date: 2012-12-20
    Department of Applied Mathematics III, Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    The objective of this thesis is to study cages, constructions and properties of such families of graphs. For this, the study of graphs without short cycles plays a fundamental role in order to develop some knowledge on their structure, so we can later deal with the problems on cages. Cages were introduced by Tutte in 1947. In 1963, Erdös and Sachs proved that (k, g) -cages exist for any given values of k and g. Since then, large amount of research in cages has been devoted to their construction. In this work we study structural properties such as the connectivity, diameter, and degree regularity of graphs without short cycles. In some sense, connectivity is a measure of the reliability of a network. Two graphs with the same edge-connectivity, may be considered to have different reliabilities, as a more refined index than the edge-connectivity, edge-superconnectivity is proposed together with some other parameters called restricted connectivities. By relaxing the conditions that are imposed for the graphs to be cages, we can achieve more refined connectivity properties on these families and also we have an approach to structural properties of the family of graphs with more restrictions (i.e., the cages). Our aim, by studying such structural properties of cages is to get a deeper insight into their structure so we can attack the problem of their construction. By way of example, we studied a condition on the diameter in relation to the girth pair of a graph, and as a corollary we obtained a result guaranteeing restricted connectivity of a special family of graphs arising from geometry, such as polarity graphs. Also, we obtained a result proving the edge superconnectivity of semiregular cages. Based on these studies it was possible to develop the study of cages. Therefore obtaining a relevant result with respect to the connectivity of cages, that is, cages are k/2-connected. And also arising from the previous work on girth pairs we obtained constructions for girth pair cages that proves a bound conjectured by Harary and Kovács, relating the order of girth pair cages with the one for cages. Concerning the degree and the diameter, there is the concept of a Moore graph, it was introduced by Hoffman and Singleton after Edward F. Moore, who posed the question of describing and classifying these graphs. As well as having the maximum possible number of vertices for a given combination of degree and diameter, Moore graphs have the minimum possible number of vertices for a regular graph with given degree and girth. That is, any Moore graph is a cage. The formula for the number of vertices in a Moore graph can be generalized to allow a definition of Moore graphs with even girth (bipartite Moore graphs) as well as odd girth, and again these graphs are cages. Thus, Moore graphs give a lower bound for the order of cages, but they are known to exist only for very specific values of k, therefore it is interesting to study how far a cage is from this bound, this value is called the excess of a cage. We studied the excess of graphs and give a contribution, in the sense of the work of Biggs and Ito, relating the bipartition of girth 6 cages with their orders. Entire families of cages can be obtained from finite geometries, for example, the graphs of incidence of projective planes of order q a prime power, are (q+1, 6)-cages. Also by using other incidence structures such as the generalized quadrangles or generalized hexagons, it can be obtained families of cages of girths 8 and 12. In this thesis, we present a construction of an entire family of girth 7 cages that arises from some combinatorial properties of the incidence graphs of generalized quadrangles of order (q,q).

  • Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación

     Aguilo Gost, Francisco de Asis Luis; Abiad Monge, Aida; Andrés Yebra, José Luis; Barriere Figueroa, Eulalia; Cámara Vallejo, Marc; Ball, Simeon Michael; Comellas Padro, Francesc de Paula; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Garriga Valle, Ernest; Gomez Marti, Jose; Llado Sanchez, Anna; López Masip, Susana Clara; Miralles De La Asuncion, Alicia; Mitjana Riera, Margarida; Muñoz Lopez, Francisco Javier; Pelayo Melero, Ignacio Manuel; Pérez Mansilla, Sonia; Rius Font, Miquel; Serra Albo, Oriol; Vena, Lluis; Vilaltella Castanyer, Joan; Zaragoza Monroig, Maria Luisa; Espona Dones, Margarida; Sau Valls, Ignasi; Montejano Cantoral, Amanda; Perarnau Llobet, Guillem; Moragas Vilarnau, Jordi; Vena Cros, Lluís; Andres Yebra, Jose Luis; Fiol Mora, Miquel Àngel
    Participation in a competitive project

     Share

  • Edge-distance-regular graphs

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    European Conference on Combinatorics, Graph Theory and Applications
    Presentation's date: 2011-08-31
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Edge-distance-regular graphs

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Journal of combinatorial theory. Series A
    Date of publication: 2011
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root. In this paper we study this concept, give some of its properties, such as the regularity of Γ, and derive some characterizations. In particular, it is shown that a graph is edge-distance-regular if and only if its k-incidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edge-distance-regularity. Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph.

  • ALGEBRAIC AND COMBINATORIC APPROACH TO PSEUDO-DISTANCE-REGULARITY OF GRAPHS AND COMPLETELY PSEUDO-REGULAR CODES.

     Cámara Vallejo, Marc
    Defense's date: 2011-06-15
    Department of Applied Mathematics IV, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • RESTRICTED CONNECTIVITY IN FAMILIES OF GRAPHS

     Montejano Cantoral, Luis Pedro
    Defense's date: 2011-09-15
    Department of Applied Mathematics III, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • ALGEBRAIC AND COMBINATORIC APPROACH TO PSEUDO-DISTANCE-REGULARITY OF GRAPHS AND COMPLETELY PSEUDO-REGULAR CODES

     Cámara Vallejo, Marc
    Defense's date: 2011-06-15
    Department of Applied Mathematics IV, Universitat Politècnica de Catalunya
    Theses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Edge-distance-regular graphs  Open access

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Date: 2011-03-11
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root. In this paper we study this concept, give some of its properties, such as the regularity of Γ, and derive some characterizations. In particular, it is shown that a graph is edge-distance-regular if and only if its k-incidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edgedistance-regularity. Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph.

  • Access to the full text
    Edge distance-regular graphs  Open access

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Electronic notes in discrete mathematics
    Date of publication: 2011
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root. In this paper we study this concept, give some of its properties, such as the regularity of Γ, and derive some characterizations. In particular, it is shown that a graph is edge-distance-regular if and only if its k-incidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edge-distance-regularity. Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph.

    * distance-regularity; * local spectra; * predistance polynomials; * the spectral excess theorem; * generalized odd graphs

  • On large (delta, D, D, 1)-graphs

     Gomez Marti, Jose; Fàbrega Canudas, Josep; Andrés Yebra, José Luis
    networks
    Date of publication: 2011-07
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Concern about fault tolerance in the design of interconnection networks has aroused interest in finding large graphs such that the subgraphs obtained by deleting any set of up to s vertices have small diameter. Clearly, 1 ≤ S ≤ Δ− 1, where Δ is the maximum degree of the graph. Graphs of maximum degree Δ, diameter ≤ D and such that the graphs obtained by deletion of up to s vertices have diameter ≤ D' are known as (Δ,D,D',s)-graphs. This article considers the case S = 1 and D = D'. In other words, it deals with the search for large graphs whose diameter does not increase after deleting one vertex. The article also contains an updated table of the largest known (Δ,D,D,1)-graphs, in which most of the entries correspond to the constructions put forward in this article.

  • Enhancing dynamic student learning by teamwork in innovative projects at an Erasmus Mundus master subject adapted to the EHEA (EEES)

     Lazaro Villa, Jose Antonio; Prat Goma, Josep; Fàbrega Canudas, Josep; Kouloumentas,, Christos
    International Congress of University Teaching and Innovation
    Presentation's date: 2010-06-30
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • A mathematical model for dynamic memory networks  Open access

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Serra Albo, Oriol; Andrés Yebra, José Luis
    International Workshop on Optimal Network Topologies
    Presentation's date: 2010-06-11
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    The aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A dynamic memory is constituted by an array of cells, each storing one datum, and an interconnection network between the cells that allows the constant circulation of the stored data. The objective is to design the interconnection network in order to have short access time and a simple memory control. We review how most of the proposals of dynamic memories that have appeared in the literature fit in this general model, and how it can be used to design new structures with good access properties. Moreover, using the idea of projecting a digraph onto a de Bruijn digraph, we propose new structures for dynamic memories with vectorial capabilities. Some of these new proposals are based on iterated line digraphs, which have been widely and successfully used by M.A. Fiol and his coauthors to solve many different problems in graph theory.

  • Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Electronic journal of combinatorics
    Date of publication: 2010-03-08
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    La recerca en matemàtica discreta a Catalunya  Open access

     Fàbrega Canudas, Josep
    Date of publication: 2010-09-08
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Volem presentar en aquest article una visió general de la recerca que es fa a Catalunya en la disciplina coneguda per matemàtica discreta. La relació de temes que podem incloure en aquesta branca de les matemàtiques no està del tot ben precisada i sovint són temes a cavall de diverses matèries de la pròpia matemàtica —com l'àlgebra, la geometria, la teoria de nombres o la teoria de la probabilitat— i d'altres matèries més pròpies de la informàtica teòrica i, fins i tot, de les telecomunicacions. En tot cas, la feina que recollim aquí fa referència als grups de recerca de les universitats catalanes que treballen en combinatòria, teoria de grafs, geometria computacional, criptologia, teoria de codis, algorísmia i teoria de la complexitat. Pel que fa a la distribució per universitats, el gruix més important d’investigadors en l’àrea es concentra a la Universitat Politècnica de Catalunya (UPC), però també trobem grups potents i molt actius a les universitats Autònoma de Barcelona (UAB), Rovira i Virgili (URV), de Lleida (UdL), i també investigadors de la Universitat Pompeu Fabra (UPF). Cal tenir present que les relacions entre els científics de l’àrea són estretes i sovint grups que tenen el centre de gravetat en una determinada universitat compten, entre els seus membres, amb investigadors d’altres universitats.

  • INTERNATIONAL WORKSHOP ON OPTIMAL NETWORK TOPOLOGIES

     Balbuena Martinez, Maria Camino Teofila; Mitjana Riera, Margarida; Serra Albo, Oriol; Fàbrega Canudas, Josep; Comellas Padro, Francesc de Paula
    Participation in a competitive project

     Share

  • Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Electronic journal of combinatorics
    Date of publication: 2009-07
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Fault tolerance results for some families of graphs

     González Moreno, Diego Antonio
    Defense's date: 2009-11-06
    Department of Applied Mathematics III, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • PROBLEMAS EXTREMALES Y DE OPTIMIZACIÓN EN TEORIA DE GRAFOS Y COMBINATORIA: APLICACIÓN AL ANALISIS Y ALGORITMOS DE REDES DE COMUNICAC

     Abiad Monge, Aida; Andres Yebra, Jose Luis; Aguilo Gost, Francisco de Asis Luis; Aroca Farrerons, Josep Maria; Ball, Simeon Michael; Barajas Tomas, Javier; Barguilla Navarrete, Jorge; Barriere Figueroa, Eulalia; Cámara Vallejo, Marc; Comellas Padro, Francesc de Paula; Dalfo Simo, Cristina; Espona Dones, Margarida; Fàbrega Canudas, Josep; Gago Alvarez, Silvia; Garriga Valle, Ernest; Gomez Marti, Jose; Llado Sanchez, Anna; López Masip, Susana Clara; Miralles De La Asuncion, Alicia; Mitjana Riera, Margarida; Montejano Cantoral, Amanda; Moragas Vilarnau, Jordi; Muñoz Lopez, Francisco Javier; Pelayo Melero, Ignacio Manuel; Perarnau Llobet, Guillem; Pérez Mansilla, Sonia; Rius Font, Miquel; Sau Valls, Ignasi; Serra Albo, Oriol; Vena, Lluis; Vilaltella Castanyer, Joan; Zaragoza Monroig, Maria Luisa; Vena Cros, Lluís; Fiol Mora, Miquel Àngel
    Participation in a competitive project

     Share

  • Investigando las matemáticas de las redes de comunicación

     Fàbrega Canudas, Josep; Serra Albo, Oriol
    Date: 2009-07-13
    Report

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • COMBINATÒRIA , TEORIA DE GRAFS I APLICACIONS

     Moragas Vilarnau, Jordi; Comellas Padro, Francesc de Paula; López Masip, Susana Clara; Mitjana Riera, Margarida; Llado Sanchez, Anna; Barriere Figueroa, Eulalia; Gomez Marti, Jose; Miralles De La Asuncion, Alicia; Pérez Mansilla, Sonia; Muñoz Lopez, Francisco Javier; Zaragoza Monroig, Maria Luisa; Dalfo Simo, Cristina; Garriga Valle, Ernest; Espona Dones, Margarida; Rius Font, Miquel; Aguilo Gost, Francisco de Asis Luis; Aroca Farrerons, Josep Maria; Cámara Vallejo, Marc; Gago Alvarez, Silvia; Ball, Simeon Michael; Andres Yebra, Jose Luis; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Pelayo Melero, Ignacio Manuel; Serra Albo, Oriol
    Participation in a competitive project

     Share

  • Algunas aplicaciones de polinomios ortogonales de variable discreta a grafos y códigos

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Seminario de Matemática Discreta
    Presentation's date: 2008-09-09
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Algunas aplicaciones de polinomios octogonales de variable discreta a grafos y códigos

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Jornadas de Matemática Discreta y Algorítmica
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Graph connectivity: properties, structure and further topics

     Fàbrega Canudas, Josep
    Seminario de Matemática Discreta
    Presentation's date: 2008-09-09
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Edge-connectivity and edge-superconnectivity in sequence graphs

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; García, P
    Discrete applied mathematics
    Date of publication: 2007-10
    Journal article

     Share Reference managers Reference managers Open in new window

  • Connectedness of digraphs and graphs under contraints on the conditional diameter

     Marcote Ordax, Francisco Javier; Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep
    networks
    Date of publication: 2005-03
    Journal article

     Share Reference managers Reference managers Open in new window

  • (d,g)-cages with g >= 10 are 4-connected

     Marcote Ordax, Francisco Javier; Pelayo Melero, Ignacio Manuel; Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep
    Discrete mathematics
    Date of publication: 2005-09
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Further topics in connectivity

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2004-01
    Book chapter

     Share Reference managers Reference managers Open in new window

  • Connectivity : properties and structure

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2004-01
    Book chapter

     Share Reference managers Reference managers Open in new window

  • Using a progressive withdrawal procedure to study superconnectivity in digraphs

     Pelayo Melero, Ignacio Manuel; Marcote Ordax, Francisco Javier; Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep
    Discrete mathematics
    Date of publication: 2003-06
    Journal article

     Share Reference managers Reference managers Open in new window

  • Some contributions to the study of the connectedness of Graphs and Digraphs.

     Marcote Ordax, Francisco Javier
    Defense's date: 2003-04-10
    Department of Applied Mathematics III, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • A Study of network capacity under deflection routing schemes

     Fàbrega Canudas, Josep
    Euro-Par
    Presentation's date: 2003-08-26
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Graph Connectivity: Properties and Structure. Codi Biblioteca 1400132574

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date: 2003-04
    Report

     Share Reference managers Reference managers Open in new window

  • Graph Connectivity: Further Topics

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date: 2003-04
    Report

     Share Reference managers Reference managers Open in new window

  • A Study of network capacity under deflection routing schemes

     Fàbrega Canudas, Josep; Muñoz Lopez, Francisco Javier
    Euro-Par
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A Study of network capacity under deflection routing schemes

     Fàbrega Canudas, Josep; Muñoz Lopez, Francisco Javier
    Lecture notes in computer science
    Date of publication: 2003-06
    Journal article

     Share Reference managers Reference managers Open in new window

  • Superconnected digraphs and graphs with small conditional diameters

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Marcote Ordax, Francisco Javier; Pelayo Melero, Ignacio Manuel
    networks
    Date of publication: 2002-03
    Journal article

     Share Reference managers Reference managers Open in new window

  • Matemática discreta

     Comellas Padro, Francesc de Paula; Fàbrega Canudas, Josep; Llado Sanchez, Anna; Lladí, A S; Serra Albo, Oriol
    Date of publication: 2002-07-31
    Book

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • How to find the maximum admissible throughput in deflection routing networks

     Fàbrega Canudas, Josep; Muñoz Lopez, Francisco Javier
    Date: 2002-07
    Report

     Share Reference managers Reference managers Open in new window

  • Preface

     Comellas Padro, Francesc de Paula; Fàbrega Canudas, Josep; Fraigniaud, P
    8th International Colloquium on Structural Information and Communication Complexity
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Matemática discreta

     Comellas Padro, Francesc de Paula; Fàbrega Canudas, Josep; Llado Sanchez, Anna; Serra Albo, Oriol
    Date of publication: 2001-03-31
    Book

     Share Reference managers Reference managers Open in new window

  • Transporte y gestión de la información en sistemas distribuidos. Modelización de redes y diseño de algoritmos (Ref.: TIC2001-2171)

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Marcote Ordax, Francisco Javier; Ozon Gorriz, Francisco Javier
    Participation in a competitive project

     Share

  • Transporte y gestión de la información en sistema distribuidos: Modelización de redes y diseño de algoritmos

     Gomez Marti, Jose; Fàbrega Canudas, Josep; Mitjana Riera, Margarida; Maureso Sanchez, Montserrat; Fiol Mora, Miquel Àngel; Pelayo Melero, Ignacio Manuel
    Participation in a competitive project

     Share

  • Transporte y gestión de la información en sistemas distribuidos. Modelización de redes y diseño de algoritmos (Ref.: TIC2000-1017)

     Fàbrega Canudas, Josep; Balbuena Martinez, Maria Camino Teofila; Marcote Ordax, Francisco Javier; Ozon Gorriz, Francisco Javier
    Participation in a competitive project

     Share