An I/O Efficient Algorithm for Minimum Spanning Trees

DOI10.1007/978-3-319-26626-8_36zbMath1473.68118OpenAlexW2400762912MaRDI QIDQ3467866

Alka Bhushan, G. Sajith

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_36

zbMATH Keywords

graph algorithmsexternal memory algorithmsminimum spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
• A functional approach to external graph algorithms
• Algorithms for memory hierarchies. Advanced lectures
• The buffer tree: A technique for designing batched external data structures
• Heaps and heapsort on secondary storage
• Improving the efficiency of parallel minimum spanning tree algorithms
• External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue
• On external-memory MST, SSSP and multi-way planar graph separation
• Efficient parallel algorithms for some graph problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item