J Bermond - Concepedia

Author

J Bermond

Also Known As

D Bauer, J Bermond, J-C. Bermond, J. -C. Bermond, J. Bermond, J.-C. Bermond, J.C Bermond, J.C. Bermond, J.‐C. BERMOND, J.‐C. Bermond

Publications

1.4K

Citations

H-Index

Concepts

All Affiliations

Université Paris-Sud Centre National de la Recherche Scientifique Institut national de recherche en sciences et technologies du numérique Laboratoire de Recherche en Informatique Centre d'Analyse et de Mathématique Sociales

About

J Bermond is an author at Université Paris-Sud specializing in network analysis, graph theory, and engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	9	9	796
2	Education	6	6	250
3	Computer Engineering	5	5	635
4	Business	4	4	107
5	Humanities	1	1	53

J Bermond

Publications

1.1K

Citations

H-Index

Page 1

	Year	Citations
Distributed Loop Computer-Networks: A Survey J Bermond, Francesc Comellas, D. Frank Hsu Journal of Parallel and Distributed Computing Network ScienceEngineeringNetwork OperationDistributed CoordinationComputer Engineering	1995	392
Large fault-tolerant interconnection networks J Bermond, Nathalie Homobono, Claudine Peyrat Graphs and Combinatorics Fault-tolerant NetworkEngineeringNetwork ScienceComputer EngineeringNetwork Analysis	1989	116
G-decomposition of Kn, where G has four vertices or less J Bermond, J. Schönheim Discrete Mathematics Graph TheoryDiscrete Mathematics	1977	79
Large graphs with given degree and diameter. II J Bermond, Charles Delorme, G. Farhi Journal of Combinatorial Theory Series B Geometric Graph TheoryNetwork ScienceGraph TheoryEngineeringExtremal Graph Theory	1984	76
On linear k-arboricity J Bermond, Jean‐Luc Fouquet, Michel Habib, Discrete Mathematics Linear K-arboricityGraph TheoryAlgebraic Graph TheoryTopological Graph TheoryExtremal Graph Theory	1984	57
An Optimization Problem in Distributed Loop Computer Networks J Bermond, G. ILLIADES, Claudine Peyrat Annals of the New York Academy of Sciences EngineeringNetwork OperationResearch InstitutionsNetwork PlanningNetwork Analysis	1989	53
Hardness and approximation of Gathering in static radio networks J Bermond, Nelson Morales, S. Pérennes, Wireless CommunicationsStatic Radio NetworksEngineeringNetwork AnalysisCommunication Complexity	2006	53
Decomposition of the complete directed graph into k-circuits J Bermond, Vance Faber Journal of Combinatorial Theory Series B Complete Directed GraphDirected GraphEngineeringGraph TheoryAlgebraic Graph Theory	1976	50
Line graphs of hypergraphs I J Bermond, Marie-Claude Heydemann, Dominique Sotteau Discrete Mathematics Geometric Graph TheoryNetwork ScienceGraph TheoryTopological Graph TheoryNetwork Analysis	1977	34
Hamilton circuits in the directed wrapped Butterfly network J Bermond, Éric Darrot, Olivier Delmas, Discrete Applied Mathematics Hamiltonian TheoryQuantum ComputingPhysicsQuantum ChaosHamiltonian System	1998	27

Page 1