Combinatorial Algorithm for the Inverse Maximum Flow Problem

Authors

  • Adrian Deaconu Transilvania University of Brasov, Romania

Keywords:

inverse combinatorial problems, minimum cut, residual network, graph search

Abstract

A method for solving the inverse maximum flow problem under the l1 norm with no constraints is presented. This method supports both, weakly and strongly polynomial implementations.

Author Biography

Adrian Deaconu, Transilvania University of Brasov, Romania

Theoretical Computer Science Dept.

Published

2008-06-23

Issue

Vol. 14(49) (2007)

Section

MATHEMATICS, INFORMATICS