Finding a feasible flow in a strongly connected network

DOI10.1016/J.ORL.2008.02.003zbMath1155.90333arXiv0711.2710OpenAlexW1525978089MaRDI QIDQ1003481

Bernhard Haeupler, Robert Endre Tarjan

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.2710

zbMATH Keywords

network flowcombinatorial algorithmsmaximum flowfeasible flowstrongly connected network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

Ortho-polygon visibility representations of embedded graphs

Cites Work

• Routing flow through a strongly connected graph
• Wheels within wheels
• Beyond the flow decomposition barrier
• Efficiency of a Good But Not Linear Set Union Algorithm
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Finding a feasible flow in a strongly connected network