Jean-Claude Bermond

Stéphan Ceroi

Networks, 2003

Hierarchical Ring Network design.

[BibT_eX]

[DOI]

Sébastien Choplin

Theory Comput. Syst., 2003

On Hamilton cycle decompositions of the tensor product of complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

Deadlock Prevention by Acyclic Orientations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

The Power of Small Coalitions in Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Traffic grooming in unidirectional WDM ring networks using design theory.

[BibT_eX]

[DOI]

David Coudert

Proceedings of IEEE International Conference on Communications, 2003

2002

Design of fault-tolerant networks for satellites (TWTA redundancy).

[BibT_eX]

[DOI]

Éric Darrot

Olivier Delmas

Networks, 2002

2001

A Broadcasting Protocol in Line Digraphs.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Xavier Muñoz

J. Parallel Distributed Comput., 2001

A note on cycle covering.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Cycle Covering.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

2000

Efficient collective communication in optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Improved Bounds for Gossiping in Mesh Bus Networks.

[BibT_eX]

[DOI]

Susan Marshall

Min-Li Yu

J. Interconnect. Networks, 2000

Optimal Orientations of Annular Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2000

Broadcasting in Hypercubes in the Circuit Switched Model.

[BibT_eX]

[DOI]

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1998

Fast Gossiping by Short Messages.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Hamilton Cycle Decomposition of the Butterfly Network.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1998

Optimal Sequential Gossiping by Short Messages.

[BibT_eX]

[DOI]

Luisa Gargano

Discret. Appl. Math., 1998

Hamilton Circuits in the Directed Wrapped Butterfly Network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

Mean eccentricities of de Bruijn networks.

[BibT_eX]

[DOI]

Zhen Liu

Michel Syska

Networks, 1997

De Bruijn and Kautz bus networks.

[BibT_eX]

[DOI]

Robin W. Dawes

Fahir Ö. Ergincan

Networks, 1997

A Note on the Dimensionality of Modified Knö;del Graphs.

[BibT_eX]

[DOI]

Hovhannes A. Harutyunyan

Arthur L. Liestman

Int. J. Found. Comput. Sci., 1997

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

Bus Interconnection Networks.

[BibT_eX]

[DOI]

Fahir Ö. Ergincan

Discret. Appl. Math., 1996

Tight Bounds on the Size of 2-Monopolies.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

Induced Broadcasting Algorithms in Iterated Line Digraphs.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Xavier Muñoz

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Antepenultimate broadcasting.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Joseph G. Peters

Networks, 1995

Distributed Loop Computer Networks: A Survey.

[BibT_eX]

[DOI]

Francesc Comellas

D. Frank Hsu

J. Parallel Distributed Comput., 1995

Efficient Broadcasting Protocols on the de Bruijn and Similar Networks.

[BibT_eX]

Proceedings of the Structure, Information and Communication Complexity, 1995

The Power of Small Coalitions in Graphs.

[BibT_eX]

David Peleg

Proceedings of the Structure, Information and Communication Complexity, 1995

Gossiping in Cayley Graphs by Packets.

[BibT_eX]

[DOI]

Takako Kodate

Proceedings of the Combinatorics and Computer Science, 1995

1994

Broadcasting and Gossiping in de Bruijn Networks.

[BibT_eX]

[DOI]

Pierre Fraigniaud

SIAM J. Comput., 1994

Dense bus networks of diameter 2.

[BibT_eX]

[DOI]

Johny Bond

Selma Djelloul

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993

On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs.

[BibT_eX]

[DOI]

Pavol Hell

J. Graph Theory, 1993

Connectivity of kautz networks.

[BibT_eX]

[DOI]

Nathalie Homobono

Claudine Peyrat

Discret. Math., 1993

1992

Broadcasting in Bounded Degree Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Construction of Large Packet Radio Networks.

[BibT_eX]

[DOI]

Pavol Hell

Parallel Process. Lett., 1992

Broadcasting in wraparound meshes with parallel monodirectional links.

[BibT_eX]

[DOI]

Philippe Michallon

Denis Trystram

Parallel Comput., 1992

Sparse broadcast graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Table of Large (Delta, D)-Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Minimal diameter double-loop networks: Dense optimal families.

[BibT_eX]

[DOI]

Dvora Tzvieli

Networks, 1991

1990

On Resolvable Mixed Path Designs.

[BibT_eX]

[DOI]

Katherine Heinrich

Min-Li Yu

Eur. J. Comb., 1990

Existence of Resolvable Path Designs.

[BibT_eX]

[DOI]

Katherine Heinrich

Min-Li Yu

Eur. J. Comb., 1990

1989

Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Jean-Michel Fourneau

Theor. Comput. Sci., 1989

Induced Subgraphs of the Power of a Cycle.

[BibT_eX]

[DOI]

Claudine Peyrat

SIAM J. Discret. Math., 1989

Hamiltonian decomposition of Cayley graphs of degree 4.

[BibT_eX]

[DOI]

Odile Favaron

Maryvonne Mahéo

J. Comb. Theory, Ser. B, 1989

Large fault-tolerant interconnection networks.

[BibT_eX]

[DOI]

Nathalie Homobono

Claudine Peyrat

Graphs Comb., 1989

Extensions of networks with given diameter.

[BibT_eX]

[DOI]

Karima Berrada

Johny Bond

Discret. Math., 1989

1987

Equivalence of Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Jean-Michel Fourneau

Alain Jean-Marie

Inf. Process. Lett., 1987

General and Efficient Decentralized Consensus Protocols.

[BibT_eX]

[DOI]

Jean-Claude König

Michel Raynal

Proceedings of the Distributed Algorithms, 1987

1986

Strategies for Interconnection Networks: Some Methods from Graph Theory.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1986

1984

Large graphs with given degree and diameter. II.

[BibT_eX]

[DOI]

G. Farhi

J. Comb. Theory, Ser. B, 1984

Regular factors in nearly regular graphs.

[BibT_eX]

[DOI]

Michel Las Vergnas

Discret. Math., 1984

On linear k-arboricity.

[BibT_eX]

[DOI]

Discret. Math., 1984

1983

Shortest coverings of graphs with cycles.

[BibT_eX]

[DOI]

Bill Jackson

François Jaeger

J. Comb. Theory, Ser. B, 1983

1982

Tables of Large Graphs with Given Degree and Diameter.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

1981

Cycles in digraphs- a survey.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Graph Theory, 1981

Longest paths in digraphs.

[BibT_eX]

[DOI]

Anne Germa

Marie-Claude Heydemann

Comb., 1981

1980

Girth in digraphs.

[BibT_eX]

[DOI]

Anne Germa

Marie-Claude Heydemann

J. Graph Theory, 1980

On the maximum number of edges in a hypergraph whose linegraph contains no cycle.

[BibT_eX]

[DOI]

Peter Frankl

F. Sterboul

Discret. Math., 1980

1979

Resolvable Decomposition of Kn.

[BibT_eX]

[DOI]

Anne Germa

J. Comb. Theory, Ser. A, 1979

1977

G-decomposition of Kn, where G has four vertices or less.

[BibT_eX]

[DOI]

Johanan Schönheim

Discret. Math., 1977

Line graphs of hypergraphs I.

[BibT_eX]

[DOI]

Marie-Claude Heydemann

Discret. Math., 1977

1976

Decomposition of the complete directed graph into k-circuits.

[BibT_eX]

[DOI]

Vance Faber

J. Comb. Theory, Ser. B, 1976

Une Heuristique pour le Calcul de l'Indice de Transitivité d'un Tournoi.

[BibT_eX]

[DOI]

Yves Kodratoff

RAIRO Theor. Informatics Appl., 1976

1975

Cycles dans les graphes et G-configurations.

[BibT_eX]

[DOI]

, 1975

1974

An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits.

[BibT_eX]

[DOI]

Discret. Math., 1974

Some Ramsey numbers for directed graphs.

[BibT_eX]

[DOI]