𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial algorithm for testing whether a graph is 3-Steiner distance hereditary

✍ Scribed by Ortrud Oellermann; Jeremy P. Spinrad

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
553 KB
Volume
55
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterization of 3-Steiner distance
A characterization of 3-Steiner distance hereditary graphs
✍ Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 174 KB πŸ‘ 1 views

Let G be a connected graph and S βŠ† V (G). Then, the Steiner distance of S in G, denoted by d G (S), is the smallest number of edges in a connected subgraph of G that contains . Some general properties about the cycle structure of k-Steiner distance hereditary graphs are established. These are then

A linear-time algorithm for connectedr-d
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
✍ BrandstοΏ½dt, Andreas; Dragan, Feodor F. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree