Flow decompositions in external memory

DOI10.1007/978-3-642-35843-2_14MaRDI QIDQ2927641zbMATH OpenOpenAlexFDO

Authors Maxim Babenko

Publication date 4 November 2014

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

Full work available at URL https://doi.org/10.1007/978-3-642-35843-2_14

Mathematics Subject Classification ID

Flows in graphs (05C21) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• External memory algorithms for finding disjoint paths in undirected graphs
• A fast algorithm of constructing decomposition of multipole flows
• Faster network algorithms based on graph decomposition
• A functional approach to external graph algorithms
• scientific article; zbMATH DE number 910869

This page was built for publication: Flow decompositions in external memory

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