𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the uniform edge-partition of a tree

✍ Scribed by Bang Ye Wu; Hung-Lung Wang; Shih Ta Kuan; Kun-Mao Chao

Book ID
108112635
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
197 KB
Volume
155
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the partition dimension of trees
On the partition dimension of trees
✍ RodrΓ­guez-VelΓ‘zquez, Juan A.; GonzΓ‘lez Yero, Ismael; LemaΕ„ska, Magdalena πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 483 KB
Partitioning the edges of a graph
Partitioning the edges of a graph
✍ A.J.W Hilton; Rhys Price Jones πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 247 KB
On the complexity of graph tree partitio
On the complexity of graph tree partition problems
✍ Roberto Cordone; Francesco Maffioli πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati