✦ LIBER ✦

On the tree packing problem

✍ Scribed by Shigeru Masuyama

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 338 KB
Volume: 35
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90040-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of the node capacitated i

The complexity of the node capacitated in-tree packing problem

✍ Shinji Imahori; Yuichiro Miyamoto; Hideki Hashimoto; Yusuke Kobayashi; Mihiro Sa 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

On the vertex packing problem

✍ C. De Simone 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 546 KB

On Cyclic Packing of a Tree

✍ Stephan Brandt; Mariusz Woźniak 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 267 KB

On the tree inclusion problem

✍ Laurent Alonso; René Schott 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 130 KB

Some remarks on packing trees

✍ Béla Bollobás 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 63 KB

The graphs Gt, G2 ..... Gt are said to be packed into a graph G if G has edge disjoint subgraphs G'~, G~ ..... G~ such that G'~ ~ G~, i = 1 ..... I. For simplicity one usuaUy identifies G~ with G~. (See [1,Ch. VIII] for a number of packing results.) Gyfirf~is and Lehel conjectured ([3], see also [1,

The superstar packing problem

✍ Marek Janata; Jácint Szabó 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 657 KB