Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.

Published in: J. Algorithms (1999)

Keyphrases

minimum cost
multiple representations
neural network
case study
multi agent systems
lower bound
np hard
worst case
higher level
symbolic representation
representation scheme