Inverse maximum flow problem in planar networks

DOI10.31926/BUT.MIF.2019.12.61.1.10zbMath1438.90282OpenAlexW2999926061MaRDI QIDQ4973761

Adrian Deaconu, Laura Ciupală

Publication date: 5 December 2019

Published in: Bulletin of the Transilvania University of Brasov Series III Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.31926/but.mif.2019.12.61.1.10

zbMATH Keywords

maximum flowinverse combinatorial optimizationstrongly polynomial timeplanar networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

This page was built for publication: Inverse maximum flow problem in planar networks