Faster network algorithms based on graph decomposition

DOI10.1007/978-3-319-75172-6_8zbMath1504.05280OpenAlexW2788445380MaRDI QIDQ1641101

Kunihiko Sadakane, Tsunehiko Nagayama, Manas Jyoti Kashyop

Publication date: 15 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-75172-6_8

zbMATH Keywords

data structuresMaximum Flow problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Flows in graphs (05C21)

This page was built for publication: Faster network algorithms based on graph decomposition