✦ LIBER ✦

Constructing full spanning trees for cubic graphs

✍ Scribed by James A. Storer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Max-leaves spanning tree is APX-hard for

✍ Paul Bonsma 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 267 KB

On Universal Graphs for Spanning Trees

✍ Chung, F. R. K.; Graham, R. L. 📂 Article 📅 1983 🏛 Oxford University Press 🌐 English ⚖ 129 KB

Efficient Steiner tree construction base

✍ Hai Zhou 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 357 KB

A Nearly Optimal Parallel Algorithm for

✍ He, Xin; Yesha, Yaacov 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 715 KB

A parallel algorithm for constructing mi

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A self-stabilizing algorithm for constru

✍ Nian-Shing Chen; Hwey-Pyng Yu; Shing-Tsaan Huang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 663 KB