𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of ultrametric partitions on graphs

✍ Scribed by Mirko Křivánek

Book ID
113163220
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
366 KB
Volume
27
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On tree-partitions of graphs
On tree-partitions of graphs
✍ Guoli Ding; Bogdan Oporowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A graph G admits a tree-partition of width k if its vertex set can be partitioned into sets of size at most k so that the graph obtained by identifying the vertices in each set of the partition, and then deleting loops and parallel edges, is a forest. In the paper, we characterize the classes of gra

On partitions of graphs into trees
On partitions of graphs into trees
✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

On clique partitions of split graphs
On clique partitions of split graphs
✍ W.D. Wallis; J. Wu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique