Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network.

Heather Booth Robert Endre Tarjan

Published in: J. Algorithms (1993)

Keyphrases

minimum cost
maximum flow
series parallel
network flow
network flow problem
spanning tree
np hard
approximation algorithms
flow network
minimum cut
network structure
evolutionary algorithm
network design
special case
push relabel
complex networks
computational complexity