✦ LIBER ✦

Resource Allocation in Bounded Degree Trees

✍ Scribed by Reuven Bar-Yehuda; Michael Beder; Yuval Cohen; Dror Rawitz

Publisher: Springer
Year: 2007
Tongue: English
Weight: 452 KB
Volume: 54
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9121-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree Bounded Spanning Trees

✍ Jun Fujisawa; Hajime Matsumura; Tomoki Yamashita 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 659 KB

Embedding nearly-spanning bounded degree

Embedding nearly-spanning bounded degree trees

✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 227 KB

Fractional Path Coloring in Bounded Degr

Fractional Path Coloring in Bounded Degree Trees with

✍ I. Caragiannis; A. Ferreira; C. Kaklamanis; S. Pérennes; H. Rivano 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 715 KB

The achromatic number of bounded degree

The achromatic number of bounded degree trees

✍ Niall Cairnie; Keith Edwards 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The achromatic number ~b(G) of a simple graph G is the largest number of colours possible in a proper vertex colouring of G in which each pair of coiours appears on at least one edge. The problem of determining the achromatic number of a tree is known to be NP-hard (Cairnie and Edwards, 1997). In t

Maximal Trees with Bounded Maximum Degre

Maximal Trees with Bounded Maximum Degree in a Graph

✍ Noga Alon; Mario Szegedy 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 123 KB

Spanning trees with bounded degrees

✍ Victor Neumann-Lara; Eduardo Rivera-Campo 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 276 KB