Pages that link to "Parameterized complexity"
From HandWiki
The following pages link to Parameterized complexity:
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Bidimensionality (← links)
- Computational complexity theory (← links)
- Computational social choice (← links)
- Computational topology (← links)
- Connected dominating set (← links)
- Entropy compression (← links)
- Graph homomorphism (← links)
- Iterative compression (← links)
- Kernelization (← links)
- Logic of graphs (← links)
- No-three-in-line problem (← links)
- NP-completeness (← links)
- Sunflower (mathematics) (← links)
- Time complexity (← links)
- Vertex k-center problem (← links)
- Proof complexity (← links)
- List of computability and complexity topics (← links)
- Steiner tree problem (← links)
- Betweenness (← links)
- Circuit rank (← links)
- Feedback arc set (← links)
- Metric k-center (← links)
- Minimum k-cut (← links)
- Trémaux tree (← links)
- Bipartite graph (← links)
- Book embedding (← links)
- Matroid rank (← links)
- Biclique-free graph (← links)
- FO (complexity) (← links)
- Cop number (← links)
- Clique-width (← links)
- Tree-depth (← links)
- Branch-decomposition (← links)
- Grundy number (← links)
- Treewidth (← links)
- Contraction hierarchies (← links)
- Hadwiger number (← links)
- Boxicity (← links)
- Induced matching (← links)
- Claw-free graph (← links)
- Intersection number (graph theory) (← links)
- Metric dimension (graph theory) (← links)
- Courcelle's theorem (← links)
- Barrier resilience (← links)
- Vertex cover (← links)
- Clique problem (← links)
- Longest path problem (← links)
- Rotation distance (← links)
- Strip packing problem (← links)
- Layered graph drawing (← links)
