Category:Search algorithms

From Wikipedia, the free encyclopedia

The main article for this category is Search algorithms.

Subcategories

This category has the following 4 subcategories, out of 4 total.

C

• ► Combinatorial optimization‎ (5 C, 56 P)

H

• ► Hashing‎ (1 C, 45 P)

I

• ► Internet search algorithms‎ (2 C, 11 P)

S

• ► String matching algorithms‎ (1 C, 13 P)

Pages in category "Search algorithms"

The following 95 pages are in this category, out of 95 total. This list may not reflect recent changes (learn more).

Combinatorial search Search algorithm * Search-based software engineering A A* search algorithm All nearest smaller values Alpha–beta pruning Amplitude amplification Any-angle path planning B B* Backjumping Backtracking Beam search Beam stack search Best bin first Best-first search Bidirectional search Binary search algorithm Breadth-first search Brute-force search C C-Link Cuckoo hashing D D* Dancing Links Day–Stout–Warren algorithm Deducting Search Algorithm Depth-first search Depth-limited search Dichotomic search Difference-map algorithm Dijkstra's algorithm Disjoint-set data structure Double hashing

D cont. Dynamic perfect hashing E Expectiminimax tree Extendible hashing F Fibonacci search technique Fractional cascading G Genetic algorithm Geometric hashing God's algorithm Graphplan Grover's algorithm H Hash function Hash table Hill climbing Hopscotch hashing I IDA* Incremental heuristic search Index mapping Interpolation search Inverted index Iterative deepening depth-first search J Jump search K K-independent hashing K-nearest neighbors algorithm Knuth's Algorithm X L Late Move Reductions Lexicographic breadth-first search Linear hashing Linear probing Linear search Locality-sensitive hashing Look-ahead (backtracking) M MaMF

M cont. Minimax MTD-f N Nearest neighbor search Null-move heuristic P Parallel metaheuristic Perfect hash function Phrase search Proof of O(log*n) time complexity of Union Find Proof-number search R Rainbow table Range Minimum Query Rapidly exploring dense trees Rapidly exploring random tree S Search game Search suggest drop-down list Semi-linear resolution Siamese method SMA* Spreading activation SSS* Stack search State space search T Ternary search Ternary search tree Trigram search U Uniform binary search Uniform-cost search Universal hashing UUHash V Variation (game tree) Ε Ε-approximate nearest neighbor search