𝔖 Bobbio Scriptorium

✦ LIBER ✦

A new algorithm for minimum spanning tree using depth-first-search in an undirected graph

✍ Scribed by Salehi-Fathabadi, H.; Ahrabian, H.

Book ID: 121291767
Publisher: Taylor and Francis Group
Year: 1995
Tongue: English
Weight: 276 KB
Volume: 57
Category: Article
ISSN: 0020-7160
DOI: 10.1080/00207169508804419

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Nearly Optimal Parallel Algorithm for

A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs

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

[IEEE Comput. Soc Fifth International Co

[IEEE Comput. Soc Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003 - Xi'an, China (27-30 Sept. 2003)] Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003 - A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem

✍ Yong Zeng, ; Yu-Ping Wang, 📂 Article 📅 2003 🏛 IEEE Comput. Soc ⚖ 239 KB