Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks.

Published in: MFCS (2010)

Keyphrases

space complexity
maximum flow
push relabel
worst case
social networks
space requirements
computational complexity
arc consistency
directed networks
special case
higher order
directed graph
low level vision
min cut max flow