Pages that link to "Item:Q650942"
From MaRDI portal
The following pages link to Faster parameterized algorithms for minor containment (Q650942):
Displaying 17 items.
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986) (← links)
- Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
- Faster Parameterized Algorithms for Minor Containment (Q3569902) (← links)
- Branch decompositions and minor containment (Q4446913) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Graph minors from simulated annealing for annealing machines with sparse connectivity (Q6073022) (← links)
- Minor embedding in broken chimera and derived graphs is NP-complete (Q6201320) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)