scientific article; zbMATH DE number 205350

zbMath0776.68093MaRDI QIDQ4693383

Ortrud R. Oellermann, Abdol-Hossein Esfahanian

Publication date: 26 November 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

communicationdistance-hereditary graphroutingNP- hardmulticomputeroptimal communication tree

Mathematics Subject Classification ID

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

Related Items (7)

Networks with small stretch number ⋮ Finding a minimum path cover of a distance-hereditary graph in polynomial time ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Graphs with bounded induced distance ⋮ Weighted connected domination and Steiner trees in distance-hereditary graphs ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

This page was built for publication: