Parameterizing Cut Sets in a Graph by the Number of Their Components.

Takehiro Ito Marcin Kaminski Daniël Paulusma Dimitrios M. Thilikos

Published in: ISAAC (2009)

Keyphrases

small number
case study
markov random field
graphical models
connected components
maximum number
random graphs
disjoint sets