Sharp separation and applications to exact and parameterized algorithms
From MaRDI portal
(Redirected from Sharp separation and applications to exact and parameterized algorithms)
Sharp separation and applications to exact and parameterized algorithms (scientific article; zbMATH DE number 5702141)
Sharp separation and applications to exact and parameterized algorithms (scientific article; zbMATH DE number 5702141)
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)