External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs

DOI10.1007/978-3-319-73117-9_21zbMath1444.68133OpenAlexW2780823994MaRDI QIDQ5127184

Ignat Kolesnichenko, Maxim A. 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

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

This page was built for publication: External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs