Flows in Undirected Unit Capacity Networks

DOI10.1137/S089548019733103XMaRDI QIDQ4255803zbMATH OpenFDO

Authors

Publication date 27 June 1999

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

Full work available at URL https://doi.org/10.1137/S089548019733103X

zbMATH Keywords

algorithmscombinatorial optimizationmaximum flowsparcificationundirected graphs

Mathematics Subject Classification ID

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

Recommendations

• Bottleneck flows in unit capacity networks
• Flows in dynamic networks with aggregate arc capacities
• Minimum flows in unit capacity networks
• scientific article; zbMATH DE number 3174052
• scientific article; zbMATH DE number 3876893
• scientific article; zbMATH DE number 4135683
• scientific article; zbMATH DE number 4085386
• Capacity Expansion in Stochastic Flow Networks
• Flows on networks: recent results and perspectives

Cited in

(18)

• Finding a feasible flow in a strongly connected network
• Two flow network simplification algorithms
• Source sink flows with capacity installation in batches
• Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values
• The parameterized complexity of the minimum shared edges problem
• On flows in simple bidirected and skew-symmetric networks
• scientific article; zbMATH DE number 1303591 (Why is no real title available?)
• AO(nm log(U/n)) time maximum flow algorithm
• scientific article; zbMATH DE number 1559539 (Why is no real title available?)
• scientific article; zbMATH DE number 1775390 (Why is no real title available?)
• Maximum flow in a network with an underestimated arc capacity
• Minimum flows in unit capacity networks
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
• Unit Capacity Maxflow in Almost $m^{4/3}$ Time
• Breaking the \(O(n^{2.5})\) deterministic time barrier for undirected unit-capacity maximum flow
• Minimum cuts in geometric intersection graphs
• On computing minimum(s,t)-cuts in digraphs
• Bottleneck flows in unit capacity networks

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

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