Suivre
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
6071995
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
2941989
Cycles in digraphs–a survey
JC Bermond, C Thomassen
Journal of Graph Theory 5 (1), 1-43, 1981
2591981
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
2481986
Graph problems arising from wavelength-routing in all-optical networks
B Beauquier, JC Bermond, L Gargano, P Hell, S Pérennes, U Vaccaro
WOCS 1997-2nd Workshop on Optics and Computer Science-11th International …, 1997
2391997
Decomposition into cycles I: Hamilton decompositions
B Alspach, JC Bermond, D Sotteau
Cycles and rays, 9-18, 1990
2131990
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
1841989
G-decomposition of Kn, where G has four vertices or less
JC Bermond, J Schönheim
Discrete Mathematics 19 (2), 113-120, 1977
1731977
Graceful graphs, radio antennae and French windmills
JC Bermond
Proceedings One day Combinatorics Conference, Research Notes in Mathematics …, 1979
1721979
Shortest coverings of graphs with cycles
JC Bermond, B Jackson, F Jaeger
Journal of Combinatorial Theory, Series B 35 (3), 297-308, 1983
1591983
Large fault-tolerant interconnection networks
JC Bermond, N Homobono, C Peyrat
Graphs and Combinatorics 5 (1), 107-123, 1989
1581989
Decomposition of complete graphs into isomorphic subgraphs with five vertices
JC Bermond, C Huang, A Rosa, D Sotteau
Ars combinatoria 10, 211-254, 1980
1481980
Graphs and interconnection networks: diameter and vulnerability
JC Bermond, J Bond, M Paoli, C Peyrat
Surveys in combinatorics 82, 1-30, 1983
1391983
Graph decompositions and G-designs
JC Bermond, D Sotteau
5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976
1361976
Efficient collective communication in optical networks
JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro
Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996
1351996
Hamiltonian graphs
JC Bermond
Selected topics in graph theory, 127-167, 1979
1331979
Hamiltonian decompositions of graphs, directed graphs and hypergraphs
JC Bermond
Annals of Discrete Mathematics 3, 21-28, 1978
1091978
On hamiltonian walks
JC Bermond
5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976
1031976
Antepenultimate broadcasting
JC Bermond, P Fraigniaud, JG Peters
Networks 26 (3), 125-137, 1995
881995
Broadcasting and gossiping in de Bruijn networks
JC Bermond, P Fraigniaud
SIAM Journal on Computing 23 (1), 212-225, 1994
881994
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20