Flows in Undirected Unit Capacity Networks

DOI10.1137/S089548019733103XzbMath0918.90067MaRDI QIDQ4255803

No author found.

Publication date: 27 June 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmscombinatorial optimizationmaximum flowundirected graphssparcification

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (4)

Minimum cuts in geometric intersection graphs ⋮ On computing minimum\((s,t)\)-cuts in digraphs ⋮ Efficient and Adaptive Parameterized Algorithms on Modular Decompositions ⋮ The parameterized complexity of the minimum shared edges problem

This page was built for publication: Flows in Undirected Unit Capacity Networks