๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heterochromatic tree partition problem in complete tripartite graphs

โœ Scribed by Zemin Jin; Shili Wen; Shujun Zhou

Book ID
113567507
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
330 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Partitioning complete multipartite graph
Partitioning complete multipartite graphs by monochromatic trees
โœ Atsushi Kaneko; M. Kano; Kazuhiro Suzuki ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 102 KB

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K (n 1 ; n 2 ; . . . ; n k )) of the c

A P-complete graph partition problem
A P-complete graph partition problem
โœ R. Sarnath; Xin He ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 881 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