✦ LIBER ✦

Finding theksmallest spanning trees

✍ Scribed by David Eppstein

Publisher: Springer Netherlands
Year: 1992
Tongue: English
Weight: 763 KB
Volume: 32
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01994879

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding most uniform spanning trees

✍ Zvi Galil; Baruch Schieber 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 243 KB

On the complexity of finding multi-const

On the complexity of finding multi-constrained spanning trees

✍ P.M. Camerini; G. Galbiati; F. Maffioli 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 602 KB

On finding optimal and near-optimal line

On finding optimal and near-optimal lineal spanning trees

✍ Michael R. Fellows; Donald K. Friesen; Michael A. Langston 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 646 KB

Finding minimal spanning trees in a eucl

Finding minimal spanning trees in a euclidean coordinate space

✍ O. Nevalainen; J. Ernvall; J. Katajainen 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 420 KB

Finding the Graph with the Maximum Numbe

Finding the Graph with the Maximum Number of Spanning Trees

✍ George Moustakides; Samuel D. Bedrosian 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 328 KB

The problem is to determine the linear graph that has the maximum number of spanning trees, where only the number of nodes N and the number of branches B are prescribed. We deal with connected graphs G(N, B) obtained by deleting D branches from a complete graph KN. Our solution is for D less than or

Efficient spanning trees

✍ H. W. Corley 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 210 KB