User:Sebastiantjing/Books/ITU/2/SAD1
 | 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 ] | ||||||||
Algorithm Design
[edit]F2016
[edit]- Big O notation
- Bipartite dimension
- Boolean satisfiability problem
- Computational complexity theory
- Decision problem
- Divide and conquer algorithm
- Dynamic programming
- Exact cover
- Flow graph (mathematics)
- Flow network
- Ford–Fulkerson algorithm
- Glossary of graph theory terms
- Graph (discrete mathematics)
- Graph coloring
- Graph theory
- Greedy algorithm
- Hamiltonian path problem
- Independent set (graph theory)
- Intersection number (graph theory)
- Knapsack problem
- List of NP-complete problems
- Longest path problem
- Max-flow min-cut theorem
- Memoization
- Minimum spanning tree
- NP (complexity)
- NP-completeness
- NP-hardness
- Optimal substructure
- P versus NP problem
- Partition problem
- Priority queue
- Reduction (complexity)
- Shortest path problem
- Subset sum problem
- Time complexity
- Travelling salesman problem
- Vertex (graph theory)
- Vertex cover