On a proposed divide-and-conquer minimal spanning tree algorithm

DOI10.1007/BF01954898zbMath0663.68083OpenAlexW2081205286MaRDI QIDQ1115202

Michael A. Langston, Ivan Stojmenović

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01954898

zbMATH Keywords

minimal spanning treedivide-and-conquer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• An O(N log N) minimal spanning tree algorithm for N points in the plane
• A taxonomy of problems with fast parallel algorithms
• Two algorithms for constructing a Delaunay triangulation

This page was built for publication: On a proposed divide-and-conquer minimal spanning tree algorithm