Pages that link to "Fixed-parameter tractable"
Showing 50 items.
- Quadratic residue (links | edit)
- Bipartite graph (links | edit)
- Hasse diagram (links | edit)
- Robertson–Seymour theorem (links | edit)
- Integer programming (links | edit)
- Combinatorial optimization (links | edit)
- 2-satisfiability (links | edit)
- Vertex cover (links | edit)
- Parameterized complexity (links | edit)
- List of complexity classes (links | edit)
- Graph homomorphism (links | edit)
- List coloring (links | edit)
- Betweenness problem (links | edit)
- Dominating set (links | edit)
- Feedback vertex set (links | edit)
- Feedback arc set (links | edit)
- Monochromatic triangle (links | edit)
- Fully polynomial-time approximation scheme (links | edit)
- No-three-in-line problem (links | edit)
- Book embedding (links | edit)
- Pathwidth (links | edit)
- Sunflower (mathematics) (links | edit)
- Crossing number (graph theory) (links | edit)
- Maximum cut (links | edit)
- Bipartite dimension (links | edit)
- Closest string (links | edit)
- Set splitting problem (links | edit)
- Permutation pattern (links | edit)
- Intersection number (graph theory) (links | edit)
- Iterative compression (links | edit)
- Utilitarian cake-cutting (links | edit)
- Leaf power (links | edit)
- Universal vertex (links | edit)
- Half graph (links | edit)
- Nonblocker (links | edit)
- Odd cycle transversal (links | edit)
- Induced matching (links | edit)
- Combinatorial participatory budgeting (links | edit)
- Crossing Numbers of Graphs (links | edit)
- Vertex cover in hypergraphs (links | edit)
- Graham–Pollak theorem (links | edit)
- Strong connectivity augmentation (links | edit)
- E-graph (links | edit)
- House allocation problem (links | edit)
- Cutwidth (links | edit)
- Twin-width (links | edit)
- Phylogenetic reconciliation (links | edit)
- Multi-issue voting (links | edit)
- Carving width (links | edit)
- Doignon's theorem (links | edit)