On external-memory MST, SSSP and multi-way planar graph separation

DOI10.1016/J.JALGOR.2004.04.001zbMATH Open1089.68075OpenAlexW2136354771WikidataQ67224673 ScholiaQ67224673MaRDI QIDQ3159489FDOQ3159489

Authors: Lars Arge, Gerth Stølting Brodal, Laura Toma 

Publication date: 16 February 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.04.001

Recommendations

• scientific article; zbMATH DE number 1617278
• Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
• An external memory data structure for shortest path queries
• scientific article; zbMATH DE number 2163020
• I/O-Efficient Planar Separators

zbMATH Keywords

breadth-first search

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cited In (8)

• An external memory data structure for shortest path queries
• I/O-efficient algorithms for graphs of bounded treewidth
• An I/O efficient algorithm for minimum spanning trees
• A functional approach to external graph algorithms
• Title not available (Why is that?)
• Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• I/O-efficient algorithms for computing planar geometric spanners

This page was built for publication: On external-memory MST, SSSP and multi-way planar graph separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159489)