✦ LIBER ✦

Complexity of spanning tree problems: Part I

✍ Scribed by P.M. Camerini; G. Galbiati; F. Maffioli

Book ID: 107989320
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 794 KB
Volume: 5
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(80)90164-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Minimum Ratio Spanning

The Complexity of Minimum Ratio Spanning Tree Problems

✍ Christopher C. Skiścim; Susan W. Palocsay 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 349 KB

Parameterized Complexity of the Spanning

Parameterized Complexity of the Spanning Tree Congestion Problem

✍ Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; Leeuwen, 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 893 KB

Problems, Models and Complexity. Part I:

Problems, Models and Complexity. Part I: Theory

✍ W. Brüggemann; K. Fischer; H. Jahnke 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 178 KB

Complexity of computation of a spanning

Complexity of computation of a spanning tree enumeration algorithm

✍ Jayakumar, R.; Thulasiraman, K.; Swamy, M. 📂 Article 📅 1984 🏛 IEEE ⚖ 1018 KB

The expected complexity of Prim's minimu

The expected complexity of Prim's minimum spanning tree algorithm

✍ Chip Martel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

We study the expected performance of Prim's minimum spanning tree (MST) algorithm implemented using ordinary heaps. We show that this implementation runs in linear or almost linear expected time on a wide range of graphs. This helps to explain why Prim's algorithm often beats MST algorithms which ha

The traveling-salesman problem and minim

The traveling-salesman problem and minimum spanning trees: Part II

✍ Michael Held; Richard M. Karp 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 644 KB