Covering a graph with cuts of minimum total size.

Zoltán Füredi André Kündgen

Published in: Discret. Math. (2001)

Keyphrases

random walk
maximal cliques
graph representation
computational complexity
directed graph
graph matching
maximum clique
small size
graph theory
graph structure
maximum number
graph theoretic
bipartite graph
graph clustering
graph search
connected components
neural network