✦ LIBER ✦

On finding optimal and near-optimal lineal spanning trees

✍ Scribed by Michael R. Fellows; Donald K. Friesen; Michael A. Langston

Publisher: Springer
Year: 1988
Tongue: English
Weight: 646 KB
Volume: 3
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01762131

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Independent Spanning Trees on Od

Optimal Independent Spanning Trees on Odd Graphs

✍ Jong-Seok Kim; Hyeong-Ok Lee; Eddie Cheng; László Lipták 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 749 KB

On the costs of optimal and near-optimal

On the costs of optimal and near-optimal binary search trees

✍ Brian Allen 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

Parallel construction of optimal indepen

Parallel construction of optimal independent spanning trees on hypercubes

✍ Jinn-Shyong Yang; Shyue-Ming Tang; Jou-Ming Chang; Yue-Li Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 212 KB

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang,

An optimal algorithm for finding depth-f

An optimal algorithm for finding depth-first spanning tree on permutation graphs

✍ Mondal, Sukumar ;Pal, Madhumangal ;Pal, Tapan K. 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 103 KB

Box-Trees and R-Trees with Near-Optimal

Box-Trees and R-Trees with Near-Optimal Query Time

✍ Agarwal; de Berg; Gudmundsson; M. Hammar; and H. J. Haverkort 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 161 KB

An adaptive and cost-optimal parallel al

An adaptive and cost-optimal parallel algorithm for minimum spanning trees

✍ S. G. Akl 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 388 KB