Pages that link to "Michael Garey"
Showing 50 items.
- P versus NP problem (links | edit)
- Computational complexity (links | edit)
- List of computer scientists (links | edit)
- Computational complexity theory (links | edit)
- Subset sum problem (links | edit)
- Minimum spanning tree (links | edit)
- NP-hardness (links | edit)
- NP-easy (links | edit)
- NP-equivalent (links | edit)
- Hamiltonian path problem (links | edit)
- Polynomial-time reduction (links | edit)
- Directed acyclic graph (links | edit)
- Ronald Graham (links | edit)
- Graph isomorphism (links | edit)
- Steiner tree problem (links | edit)
- Complexity class (links | edit)
- David S. Johnson (links | edit)
- Cook–Levin theorem (links | edit)
- Euclidean minimum spanning tree (links | edit)
- L (complexity) (links | edit)
- List of NP-complete problems (links | edit)
- Garey (links | edit)
- Michael R. Garey (redirect page) (links | edit)
- Boolean satisfiability problem (links | edit)
- Knapsack problem (links | edit)
- Unary numeral system (links | edit)
- Subset sum problem (links | edit)
- Quadratic programming (links | edit)
- Linear programming (links | edit)
- PSPACE-complete (links | edit)
- Post correspondence problem (links | edit)
- Quadratic residue (links | edit)
- Clique problem (links | edit)
- Bin packing problem (links | edit)
- Bottleneck traveling salesman problem (links | edit)
- Graph coloring (links | edit)
- Subgraph isomorphism problem (links | edit)
- Complete bipartite graph (links | edit)
- Vertex cover (links | edit)
- Matching (graph theory) (links | edit)
- Polynomial hierarchy (links | edit)
- Complete coloring (links | edit)
- Circle graph (links | edit)
- Quadratic assignment problem (links | edit)
- Metric dimension (graph theory) (links | edit)
- Feedback vertex set (links | edit)
- Feedback arc set (links | edit)
- Set packing (links | edit)
- Cut (graph theory) (links | edit)
- Shortest common supersequence (links | edit)
- Degree-constrained spanning tree (links | edit)
- Pseudo-polynomial time (links | edit)
- Pursuit–evasion (links | edit)
- Maximum common induced subgraph (links | edit)
- Edge cover (links | edit)
- List of multiple discoveries (links | edit)
- Strong NP-completeness (links | edit)
- Gadget (computer science) (links | edit)
- Computers and Intractability (links | edit)
- Clique cover (links | edit)
- Frederick W. Lanchester Prize (links | edit)
- Maximum cut (links | edit)
- Edge dominating set (links | edit)
- Minimum-weight triangulation (links | edit)
- S. L. Hakimi (links | edit)
- Minimum routing cost spanning tree (links | edit)
- Multipartite graph (links | edit)
- Rainbow matching (links | edit)
- Pseudo-polynomial transformation (links | edit)
- Talent scheduling (links | edit)
- Talk:Computational complexity theory (links | edit)
- Talk:Subset sum problem (links | edit)
- User:Virginia-American/Sandbox/References (links | edit)
- User:Virginia-American/Sandbox (links | edit)
- User:Tcshasaposse/Computational complexity theory (links | edit)
- User:Miym/Sandbox (links | edit)
- User:Guilhermereisrbm/sandbox (links | edit)
- User:Guilherme Reis/sandbox (links | edit)
- User:HusseinHoudrouge/sandbox (links | edit)
- User:金色黎明/Talent Scheduling (links | edit)
- User talk:Liz/Whiteboard2 (links | edit)
- File:Garey, Johnson, Intractability, cover.jpg (links | edit)
- Mike Garey (redirect page) (links | edit)
- Dominating set (links | edit)
- Domatic number (links | edit)
- Monochromatic triangle (links | edit)
- Graph isomorphism problem (links | edit)
- List of University of Wisconsin–Madison people (links | edit)
- Exact cover (links | edit)
- Transitive reduction (links | edit)
- Book embedding (links | edit)
- 3-partition problem (links | edit)
- Induced path (links | edit)
- List of PSPACE-complete problems (links | edit)
- Computers and Intractability (links | edit)
- List of people by Erdős number (links | edit)
- Asymptotic computational complexity (links | edit)
- Crossing number (graph theory) (links | edit)
- Bipartite dimension (links | edit)
- Set splitting problem (links | edit)
- 3-dimensional matching (links | edit)
- NP-completeness (links | edit)
- Graph bandwidth (links | edit)
- Intersection number (graph theory) (links | edit)
- Topological graph (links | edit)
- Bipartite half (links | edit)
- Rainbow matching (links | edit)
- Chordal completion (links | edit)
- M. R. Garey (redirect page) (links | edit)