Parameterizing cut sets in a graph by the number of their components

DOI10.1016/j.tcs.2011.07.005zbMath1232.05115MaRDI QIDQ653326

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

Publication date: 9 January 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.005

zbMATH Keywords

disconnected cut

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C40: Connectivity