Publication:4693383
From MaRDI portal
zbMath0776.68093MaRDI QIDQ4693383
Ortrud R. Oellermann, Abdol-Hossein Esfahanian
Publication date: 26 November 1993
communication; distance-hereditary graph; routing; NP- hard; multicomputer; optimal communication tree
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
Related Items
Graphs with bounded induced distance, Networks with small stretch number, Weighted connected domination and Steiner trees in distance-hereditary graphs, (\(k,+\))-distance-hereditary graphs, Finding a minimum path cover of a distance-hereditary graph in polynomial time, Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way