Pages that link to "Vertex cover"
From HandWiki
The following pages link to Vertex cover:
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Linear programming (← links)
- Bidimensionality (← links)
- Blocking set (← links)
- Covering graph (← links)
- Covering problems (← links)
- Geometric set cover problem (← links)
- Glossary of graph theory terms (← links)
- Iterative compression (← links)
- Kernelization (← links)
- Kőnig's theorem (graph theory) (← links)
- Set cover problem (← links)
- Set packing (← links)
- Sperner family (← links)
- The Art of Computer Programming (← links)
- Vertex (graph theory) (← links)
- Wiener connector (← links)
- Approximation algorithm (← links)
- Parameterized complexity (← links)
- List of NP-complete problems (← links)
- APX (← links)
- Holographic algorithm (← links)
- Polygon covering (← links)
- Hungarian algorithm (← links)
- Vertex covering number (redirect page) (← links)
- Boxicity (← links)
- Matching (graph theory) (← links)
- Metric dimension (graph theory) (← links)
- Nondeterministic constraint logic (← links)
- Integer programming (← links)
- Maximal independent set (← links)
- Odd cycle transversal (← links)
- Feedback vertex set (← links)
- Independent set (graph theory) (← links)
- Edge cover (← links)
- Well-covered graph (← links)
- Cubic graph (← links)
- Line graph (← links)
- Frankl–Rödl graph (← links)
- Constraint composite graph (← links)
- Constraint Composite Graph (← links)
- Local search (optimization) (← links)
- Bin packing problem (← links)
- Klam value (← links)
- Perfect graph (← links)
- Planar separator theorem (← links)
- Matching in hypergraphs (← links)
- Bipartite double cover (← links)
- Glossary of graph theory (← links)
- Bin covering problem (← links)
- Cutwidth (← links)
