The Maximum Flow Problem with Conflict and Forcing Conditions
From MaRDI portal
Publication:3091512
DOI10.1007/978-3-642-21527-8_34zbMath1345.05040OpenAlexW57886417WikidataQ61638316 ScholiaQ61638316MaRDI QIDQ3091512
Joachim Schauer, Ulrich Pferschy
Publication date: 9 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_34
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)
Related Items (7)
The maximum flow problem with disjunctive constraints ⋮ Parameterized complexity of conflict-free matchings and paths ⋮ The knapsack problem with forfeit sets ⋮ Exploring the Kernelization Borders for Hitting Cycles ⋮ Unnamed Item ⋮ Conflict free version of covering problems on graphs: classical and parameterized ⋮ Parameterized complexity of conflict-free set cover
This page was built for publication: The Maximum Flow Problem with Conflict and Forcing Conditions
