Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks

DOI10.1007/978-3-642-15155-2_18zbMath1287.68069OpenAlexW1561861429MaRDI QIDQ3586083

Beate Bollig

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ On efficient implicit OBDD-based algorithms for maximal matchings ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations

This page was built for publication: Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks