Jean-Claude Bermond
Jean-Claude Bermond
Directeur de Recherche CNRS
Adresse e-mail validée de sophia.inria.fr
Titre
Citée par
Citée par
Année
Distributed loop computer-networks: a survey
JC Bermond, F Comellas, DF Hsu
Journal of parallel and distributed computing 24 (1), 2-10, 1995
5551995
De Bruijn and Kautz networks: a competitor for the hypercube?
JC Bermond, C Peyrat
First European Workshop on Hypercube and Distributed Computers, pp 279-283, 1989
2751989
Graph problems arising from wavelength-routing in all-optical networks
B Beauquier, JC Bermond, L Gargano, P Hell, S Pérennes, U Vaccaro
INRIA, 1997
2341997
Cycles in digraphs–a survey
JC Bermond, C Thomassen
Journal of Graph Theory 5 (1), 1-43, 1981
2281981
Strategies for interconnection networks: some methods from graph theory
JC Bermond, C Delorme, JJ Quisquater
Journal of Parallel and Distributed Computing 3 (4), 433-449, 1986
2191986
Decomposition into cycles I: Hamilton decompositions
B Alspach, JC Bermond, D Sotteau
Cycles and rays, 9-18, 1990
1871990
Hamiltonian decomposition of Cayley graphs of degree 4
JC Bermond, O Favaron, M Maheo
Journal of Combinatorial Theory, Series B 46 (2), 142-153, 1989
1721989
G-decomposition of Kn, where G has four vertices or less
JC Bermond, J Schönheim
Discrete Mathematics 19 (2), 113-120, 1977
1601977
Graceful graphs, radio antennae and French windmills
JC Bermond
Proceedings One day Combinatorics Conference, Research Notes in Mathematics …, 1979
1561979
Large fault-tolerant interconnection networks
JC Bermond, N Homobono, C Peyrat
Graphs and Combinatorics 5 (1), 107-123, 1989
1461989
Shortest coverings of graphs with cycles
JC Bermond, B Jackson, F Jaeger
Journal of Combinatorial Theory, Series B 35 (3), 297-308, 1983
1421983
Decomposition of complete graphs into isomorphic subgraphs with five vertices
JC Bermond, C Huang, A Rosa, D Sotteau
Ars combinatoria 10, 211-254, 1980
1371980
Graphs and Interconnection networks: diameter and vulnerability, London Math Society Lecture Notes Series 82
JC Bermond, J Bond, M Paoli, C Peyrat
Surveys in combinatorics, 1-30, 1983
1351983
Graph decompositions and G-designs
JC Bermond, D Sotteau
5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976
1271976
Efficient collective communication in optical networks
JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro
International Colloquium on Automata, Languages, and Programming, 574-585, 1996
1251996
Hamiltonian graphs
JC Bermond
Selected topics in graph theory, 127-167, 1979
1141979
On hamiltonian walks
JC Bermond
5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976
931976
Hamiltonian decompositions of graphs, directed graphs and hypergraphs
JC Bermond
Annals of Discrete Mathematics 3, 21-28, 1978
891978
Interconnection networks
JC Bermond
Elsevier, 2016
852016
Antepenultimate broadcasting
JC Bermond, P Fraigniaud, JG Peters
Networks 26 (3), 125-137, 1995
811995
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20