𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a unique tree representation for P4-extendible graphs

✍ Scribed by B. Jamison; S. Olariu

Book ID
104184190
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
944 KB
Volume
34
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Mathematical representation with graphic
Mathematical representation with graphic reconstruction on a microcomputer for an arterial tree
✍ Da-Jun Ying; Gwang-Tsi Ho πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 528 KB

The branching arterial tree is considered as a collection of numerous points and lines. When treated with vertex analysis, it can be expressed with a new mathematical representation, and graphical reconstruction can be carded out on a microcomputer. This new method is useful for recording an arteria

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