scientific article; zbMATH DE number 205350

MaRDI QIDQ4693383zbMATH OpenFDO

Authors Abdol-Hossein Esfahanian, Ortrud R. Oellermann

Publication date 26 November 1993

zbMATH Keywords

communicationdistance-hereditary graphmulticomputerNP- hardoptimal communication treerouting

Mathematics Subject Classification ID

Distance in graphs (05C12) Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A message-routing strategy for multicomputer systems
• scientific article; zbMATH DE number 139789
• The path-partition problem in bipartite distance-hereditary graphs
• scientific article; zbMATH DE number 867692
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination

Cited in

(11)

• 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 (extended abstract)
• scientific article; zbMATH DE number 139789 (Why is no real title available?)
• Graphs with bounded induced distance
• Compact-port routing models and applications to distance-hereditary graphs
• On distance preserving and sequentially distance preserving graphs
• A characterization of almost-2-distance-hereditary graphs in terms of their forbidden subgraphs
• Networks with small stretch number

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4693383)