On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

DOI10.1007/978-3-642-34611-8_33zbMath1341.68060OpenAlexW1724422478MaRDI QIDQ5200519

Pinar Heggernes, Yngve Villanger, Neeldhara Misra, Dániel Marx, Pim van 't Hof

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34611-8_33

zbMATH Keywords

connected \(s\)-\(t\) separator of minimum size

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the parameterized complexity of finding separators with non-hereditary properties

This page was built for publication: On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties