Pages that link to "Vertex cover problem"
From Wikipedia, the free encyclopedia
The following pages link to Vertex cover problem
View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500)
- Computational complexity theory (links)
- Graph theory (links)
- Linear programming (links)
- Local search (optimization) (links)
- List of graph theory topics (links)
- List of computability and complexity topics (links)
- Approximation algorithm (links)
- Parameterized complexity (links)
- User:LarryGilbert/Sample of candidates for table cleanup (links)
- Talk:Graph coloring (links)
- Reduction (complexity) (links)
- Set cover problem (links)
- Covering problem (links)
- Dominating set problem (links)
- Maximal independent set (links)
- Feedback arc set (links)
- Talk:List of NP-complete problems (links)
- Karp's 21 NP-complete problems (links)
- APX (links)
- Domination analysis (links)
- User:Creidieki/complexity draft (links)
- König's theorem (graph theory) (links)
- Wikipedia talk:WikiProject Computing/Archive 1 (links)
- Talk:Covering (graph theory) (links)
- User talk:Gaius Cornelius/Archive (links)
- User:Salix alba/One day of mathematics page views (links)
- User talk:David Eppstein/2007 (links)
- Shmuel Safra (links)
- User:Mathbot/Most linked math articles2 (links)
- User:Tcshasaposse/Computational complexity theory (links)
- NP-complete (links)
