External memory algorithms for finding disjoint paths in undirected graphs

DOI10.1007/978-3-319-73117-9_21MaRDI QIDQ5127184zbMATH OpenOpenAlexFDO

Authors Ignat Kolesnichenko, Maxim Babenko

Publication date 21 October 2020

Published in SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-73117-9_21

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• External memory BFS on undirected graphs with bounded degree.
• External-memory exact and approximate all-pairs shortest-paths in undirected graphs
• A functional approach to external graph algorithms
• scientific article; zbMATH DE number 1947435
• scientific article; zbMATH DE number 910869

Cited in

(3)

• An external-memory algorithm for string graph construction
• Flow decompositions in external memory
• Design and Engineering of External Memory Traversal Algorithms for General Graphs

This page was built for publication: External memory algorithms for finding disjoint paths in undirected graphs

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