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

DOI10.1007/978-3-642-34611-8_33MaRDI QIDQ5200519zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• On the parameterized complexity of finding separators with non-hereditary properties
• Parameterized and Exact Computation
• Parameterized graph separation problems
• Connected \((s,t)\)-vertex separator parameterized by chordality
• Finding small separators in linear time via treewidth reduction

Cited in

(3)

• On the parameterized complexity of finding separators with non-hereditary properties
• Finding a maximum minimal separator: graph classes and fixed-parameter tractability
• Connected \((s,t)\)-vertex separator parameterized by chordality

This page was built for publication: On the parameterized complexity of finding separators with non-hereditary properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200519)