Parameterizing Cut Sets in a Graph by the Number of Their Components
From MaRDI portal
Publication:3652247
DOI10.1007/978-3-642-10631-6_62zbMath1272.05202MaRDI QIDQ3652247
Marcin Kaminski, Takehiro Ito, Dimitrios M. Thilikos, Daniël Paulusma
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_62
Related Items
Unnamed Item, The complexity of surjective homomorphism problems-a survey, Parameterizing cut sets in a graph by the number of their components, On disconnected cuts and separators