User:Paperwheel/Books/comprobs-g
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Computational Problems in Graph Theory
[edit]- Computational problem
- Canadian traveller problem
- Clique cover problem
- Clique problem
- Connected dominating set
- Correlation clustering
- Degree diameter problem
- Domatic number
- Dominating set
- Edge cover
- Edge dominating set
- Feedback arc set
- Feedback vertex set
- Graph coloring
- Graph cuts in computer vision
- Graph isomorphism problem
- Graph partition
- Graph sandwich problem
- Hamiltonian path
- Hamiltonian path problem
- Independent set (graph theory)
- Induced subgraph isomorphism problem
- Instant Insanity
- K shortest path routing
- Longest path problem
- Longest uncrossed knight's path
- MaxDDBS
- Maximal independent set
- Maximum common subgraph isomorphism problem
- Maximum cut
- Metric k-center
- Minimum k-cut
- Multi-trials technique
- Pebble motion problems
- Planarity testing
- Route inspection problem
- Set TSP problem
- Shortest path problem
- Snake-in-the-box
- Spanning tree
- Steiner tree problem
- Subgraph isomorphism problem
- Travelling salesman problem
- Unrooted tree path lengths
- Vertex cover
- Vertex cycle cover
- Widest path problem
- 2-opt
- 3-opt
- Christofides algorithm
- Concorde TSP Solver
- Lin–Kernighan heuristic
- Nearest neighbour algorithm
- Traveling purchaser problem