Faster parameterized algorithms for minor containment
From MaRDI portal
Recommendations
- Faster parameterized algorithms for minor containment
- Faster Parameterized Algorithms for Minimum Fill-In
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- A faster parametric minimum-cut algorithm
- Quickly deciding minor-closed parameters in general graphs
- Exponential time improvement for min-wise based algorithms
- Exponential time improvement for min-wise based algorithms
- Faster algorithms for all-pairs bounded min-cuts
- Fast algorithms for min independent dominating set
Cites work
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 5764900 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 6783431 (Why is no real title available?)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Branch decompositions and minor containment
- Call routing and the ratcatcher
- Dynamic programming for graphs on surfaces
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
- Fast minor testing in planar graphs
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
- Graphs on surfaces
- Hadwiger's conjecture is decidable
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Nonconstructive tools for proving polynomial-time decidability
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Planar subgraph isomorphism revisited
- Quickly excluding a planar graph
- Subexponential parameterized algorithms
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- Subgraph Isomorphism in Planar Graphs and Related Problems
- The disjoint paths problem in quadratic time
- The graph genus problem is NP-complete
Cited in
(19)- Explicit linear kernels for packing problems
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Fast minor testing in planar graphs
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Quickly deciding minor-closed parameters in general graphs
- Faster parameterized algorithms for minor containment
- Minor embedding in broken chimera and derived graphs is NP-complete
- A more accurate view of the flat wall theorem
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Faster parameterized algorithms for modification problems to minor-closed classes
- Adiabatic quantum programming: minor embedding with hard faults
- Fast minor testing in planar graphs
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- Hard combinatorial problems and minor embeddings on lattice graphs
- Differential geometric treewidth estimation in adiabatic quantum computation
- Branch decompositions and minor containment
- Graph minors from simulated annealing for annealing machines with sparse connectivity
This page was built for publication: Faster parameterized algorithms for minor containment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650942)
