Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
From MaRDI portal
Recommendations
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Algorithms – ESA 2005
- Mathematical Foundations of Computer Science 2004
Cited in
(14)- Approximation algorithms via contraction decomposition
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Surface split decompositions and subgraph isomorphism in graphs on surfaces
- Graph minors and parameterized algorithm design
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Subexponential parameterized algorithms
- Confronting intractability via parameters
- Coverability and sub-exponential parameterized algorithms in planar graphs
- Contraction-bidimensionality of geometric intersection graphs
- Dynamic programming for graphs on surfaces
- Faster parameterized algorithms for minor containment
- Contraction bidimensionality of geometric intersection graphs
- Dynamic programming and planarity: improved tree-decomposition based algorithms
This page was built for publication: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757875)
