Jump to content

Wikipedia:Books/archive/Algorithms

From Wikipedia, the free encyclopedia


Algorithms

[edit]
Sorting
Sorting algorithm
Comparison sort
Selection sort
Insertion sort
Merge sort
In-place merge sort
Quicksort
Heapsort
Bubble sort
Shell sort
Integer sorting
Counting sort
Bucket sort
Radix sort
Searching
Data structures
Search algorithm
Linear search
Binary search algorithm
Binary search tree
Trie
Hash table
Hash function
Hash collision
Perfect hash function
Open addressing
Linear probing
Quadratic probing
Double hashing
Cuckoo hashing
Random numbers
Random number generation
Pseudorandom number generator
Linear congruential generator
Middle-square method
Xorshift
Mersenne Twister
Cryptographically secure pseudorandom number generator
Blum Blum Shub
Blum-Micali algorithm
Combinatorial Algorithms
Combinatorics
Cycle detection
Stable marriage problem
Graph algorithms
Graph theory
Graph coloring
A* search algorithm
Algorithmic version for Szemerédi regularity partition
Alpha–beta pruning
Aperiodic graph
B*
Barabási–Albert model
Belief propagation
Bellman–Ford algorithm
Bidirectional search
Borůvka's algorithm
Bottleneck traveling salesman problem
Breadth-first search
Bron–Kerbosch algorithm
Centrality
Chaitin's algorithm
Christofides algorithm
Clique percolation method
Closure problem
Color-coding
Contraction hierarchies
Courcelle's theorem
Cuthill–McKee algorithm
D*
Depth-first search
Depth-limited search
Dijkstra's algorithm
Dijkstra–Scholten algorithm
Dinic's algorithm
Double pushout graph rewriting
Dulmage–Mendelsohn decomposition
Edmonds' algorithm
Blossom algorithm
Edmonds–Karp algorithm
Euler tour technique
FKT algorithm
Flooding algorithm
Flow network
Floyd–Warshall algorithm
Force-directed graph drawing
Ford–Fulkerson algorithm
Fringe search
Girvan–Newman algorithm
Goal node
Gomory–Hu tree
Graph bandwidth
Graph embedding
Graph isomorphism
Graph isomorphism problem
Graph kernel
Graph reduction
Graph traversal
Hierarchical clustering of networks
Hopcroft–Karp algorithm
IDA*
Iterative deepening depth-first search
Johnson's algorithm
Journal of Graph Algorithms and Applications
Jump point search
K shortest path routing
Karger's algorithm
Knight's tour
Kosaraju's algorithm
Kruskal's algorithm
Lexicographic breadth-first search
Longest path problem
Minimax
Minimum cut
Nearest neighbour algorithm
Nonblocking minimal spanning switch
Path-based strong component algorithm
Prim's algorithm
Proof-number search
Push–relabel maximum flow algorithm
Reverse-delete algorithm
Sethi–Ullman algorithm
Shortest Path Faster Algorithm
Shortest path problem
SMA*
Spectral layout
Strongly connected component
Subgraph isomorphism problem
Suurballe's algorithm
Tarjan's off-line lowest common ancestors algorithm
Tarjan's strongly connected components algorithm
Topological sorting
Transitive closure
Transitive reduction
Travelling salesman problem
Tree traversal
Uniform-cost search
Widest path problem
Yen's algorithm
Hungarian algorithm
Prüfer sequence
Graph Drawing
Graph drawing
Analysis of algorithms and computational complexity
Analysis of algorithms
Time complexity
Space complexity
Asymptotic notation
Master theorem
Best, worst and average case
Amortized analysis
Computational complexity theory
Complexity class
P (complexity)
NP (complexity)
NP-hardness
NP-completeness
PSPACE
EXPSPACE
P versus NP problem