Pages that link to "Parameterized complexity"
Jump to navigation
Jump to search
The following pages link to Parameterized complexity:
Displaying 50 items.
- Complexity (← links)
- Computational complexity theory (← links)
- SameGame (← links)
- Bipartite graph (← links)
- Interval graph (← links)
- Random ballot (← links)
- Time complexity (← links)
- 2-satisfiability (← links)
- Steiner tree problem (← links)
- Clique (graph theory) (← links)
- Vertex cover (← links)
- Graph homomorphism (← links)
- Edge coloring (← links)
- Chordal graph (← links)
- Cograph (← links)
- Circuit rank (← links)
- Paul Seymour (mathematician) (← links)
- Metric dimension (graph theory) (← links)
- Feedback arc set (← links)
- No-three-in-line problem (← links)
- Connected dominating set (← links)
- Proof complexity (← links)
- Treewidth (← links)
- Book embedding (← links)
- Grundy number (← links)
- Sunflower (mathematics) (← links)
- Boxicity (← links)
- Claw-free graph (← links)
- Kernelization (← links)
- Clique-width (← links)
- Branch-decomposition (← links)
- Longest path problem (← links)
- Planar separator theorem (← links)
- Closest string (← links)
- Equitable coloring (← links)
- NP-completeness (← links)
- Minimum k-cut (← links)
- Metric k-center (← links)
- Tree-depth (← links)
- Exponential time hypothesis (← links)
- Bidimensionality (← links)
- Contraction hierarchies (← links)
- Trémaux tree (← links)
- Intersection number (graph theory) (← links)
- Graver basis (← links)
- Hans L. Bodlaender (← links)
- Courcelle's theorem (← links)
- Matroid minor (← links)
- Matroid rank (← links)
- Upward planar drawing (← links)