Sharp separation and applications to exact and parameterized algorithms

DOI10.1007/978-3-642-12200-2_8MaRDI QIDQ3557010zbMATH OpenOpenAlexWikidataFDO

Authors Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh

Publication date 27 April 2010

Published in LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12200-2_8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Sharp separation and applications to exact and parameterized algorithms
• Exact and parameterized algorithms for Max Internal Spanning Tree
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
• Finding small separators in linear time via treewidth reduction
• Treewidth reduction for constrained separation and bipartization problems

Cited in

(5)

• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
• Sharp separation and applications to exact and parameterized algorithms
• Treewidth reduction for constrained separation and bipartization problems
• New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures
• An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth

This page was built for publication: Sharp separation and applications to exact and parameterized algorithms

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