✦ LIBER ✦

Transforming spanning trees: A lower bound

✍ Scribed by Kevin Buchin; Andreas Razen; Takeaki Uno; Uli Wagner

Book ID: 108100987
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 179 KB
Volume: 42
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2008.03.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower-Stretch Spanning Trees

✍ Elkin, Michael; Emek, Yuval; Spielman, Daniel A.; Teng, Shang-Hua 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 275 KB

A lower bound on the number of spanning

A lower bound on the number of spanning trees with k end-vertices

✍ Katherine Heinrich; Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span

Degree Bounded Spanning Trees

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

Spanning trees with bounded degrees

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

An Inverse-Ackermann Type Lower Bound Fo

An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*

✍ Seth Pettie† 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 382 KB

Lower and upper bounds for the degree-co

Lower and upper bounds for the degree-constrained minimum spanning tree problem

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views