User:Sebastiantjing/Books/Algorithm Design
 | 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
F2016
- 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
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.