On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.

Alexander A. Ageev

Published in: ESA (1999)

Keyphrases

maximum number
maximum clique
pairwise
objective function
graph representation
structured objects
machine learning
information systems
directed graph
graph structure
weighted graph