𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A minimum-length covering subtree of a tree

✍ Scribed by Tae Ung Kim; Timothy J. Lowe; James E. Ward; Richard L. Francis

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
1019 KB
Volume
37
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The subtree center of a tree
The subtree center of a tree
✍ Nieminen, Juhani; Peltola, Matti πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 107 KB πŸ‘ 2 views

A method to determine the least central subtree of a tree is given. The structure of the trees having a single point as a least central subtree is described, and the relation of a least central subtree of a tree to the centroid as well as to the center of that tree is given.

Covering the Edges of a Graph by a Presc
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap
✍ Noga Alon; Yair Caro; Raphael Yuster πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over