Minimum-weight spanning tree algorithms A survey and empirical study

2001/07/01 by Cüneyt F. Bazlamaçcı, Khalil S. Hindi, K.S. Hindi · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Smart Parking Systems Research

paper · doi:10.1016/s0305-0548(00)00007-1

openalex publication_date 2001/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Shortest Connection Networks And Some Generalizations
• A randomized linear-time algorithm to find minimum spanning trees

Cited by

• a-TMFG: Scalable Triangulated Maximally Filtered Graphs via Approximate Nearest Neighbors