Simplified external memory algorithms for planar DAGs

DOI10.1007/978-3-540-27810-8_42MaRDI QIDQ5315400zbMATH OpenOpenAlexFDO

Authors Lars Arge, Laura Toma

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
• I/O-Efficient Planar Separators
• I/O-efficient algorithms for topological sort and related problems
• scientific article; zbMATH DE number 2119685
• On External-Memory Planar Depth First Search

Cited in

(7)

• On external-memory planar depth first search
• I/O-efficient algorithms for topological sort and related problems
• A topological sorting algorithm for large graphs
• Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
• I/O-efficient algorithms on near-planar graphs
• I/O-Efficient Algorithms on Near-Planar Graphs
• I/O-Efficient Algorithms for Topological Sort and Related Problems

This page was built for publication: Simplified external memory algorithms for planar DAGs

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