scientific article; zbMATH DE number 553917

zbMATH Open0802.68096MaRDI QIDQ4288087FDOQ4288087

Authors: Abdol-Hossein Esfahanian, Ortrud R. Oellermann 

Publication date: 21 April 1994

Title of this publication is not available (Why is that?)

zbMATH Keywords

communicationroutingdistance-hereditary graphNP- hardmulticomputeroptimal communication tree

Mathematics Subject Classification ID

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

Cited In (2)

• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• Equistable distance-hereditary graphs

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 Q4288087)