Up: Index - All
- #P-completeness
, - 0/1 knapsack problem
- 2-SAT
- 2/3 tree
- 3-SAT
, - k-optimal tours
- metric
-
-
- -moves
- above-below test
, - abracadabra
- abstract data types
- abstract graph type
- academic institutions - licensing
- acceptance-rejection method
- Ackerman function
- acyclic subgraph
- Ada
- adaptive compression algorithms
- Adaptive Simulated Annealing (ASA)
- addition
- address book, TCS
- adjacency list
, - adjacency matrix
, - adjacent swaps
- advice - caveat
- aesthetically pleasing drawings
- aggregate range queries
- agrep
- Aho-Corasick algorithm
- airline distance metric
- airline scheduling
, - algorist
- Algorist Technologies
- algorithm animation
- algorithm design
- algorithmic resources
- aligning DNA sequences
- alignment costs
- all-pairs shortest path
, , - alpha-beta pruning
, - alpha-shapes
- amortized analysis
- AMPL
- analog channel
- ancestor
- angle bisector
- animation - motion planning
- animation - sorting
- animation - systems
- annotated bibliography
- approximate nearest neighbor search
, - approximate string matching
, , , - approximate string matching - related problems
, - approximate substring matching
- approximation algorithms
, - approximation scheme
, - arbitrage
- Arbitrary-Precision Arithmetic
- arbitrary-precision arithmetic - geometry
- arbitrary-precision arithmetic - related problems
- architectural models
- area computations - applications
- area computations - triangles
- area minimization
- arm, robot
- around the world game
- Arrange
, - arrangement
, , - arrangement of objects
- arrangements of lines
- array
- array searching
- art gallery problems
- articulation vertex
, - artists steal
- ASA
- ASCII
- aspect ratio
- assembly language
, - assignment problem
- associative operation
- asymmetric longest path problem
- asymmetric TSPs
, - asymptotic analysis
- atom smashing
- attitude of the algorithm designer
- attribute
- attribute - graph
- augmenting path
- augmenting path methods
- authentication protocol
- automorphisms
- average
- average-case analysis
- average-case complexity
- AVL tree
- Avogadro's number
- awk
- Axiom
- axis-oriented rectangles
, - axis-parallel planes
- B-tree
, , , - backpacker
- backsubstitution
- backtracking
, , , , , , , , , - backtracking - animations
- backtracking - applications
, - backtracking - bandwidth problem
- balanced search tree
, , - banded systems
, - bandersnatch problem
- bandwidth
, - bandwidth - matrix
- Bandwidth Reduction
- bandwidth reduction - backtracking
- bandwidth reduction - related problems
- bar codes
- base - arithmetic
- base - conversion
- base of logarithm
- Bellman-Ford algorithm
, - Berge's theorem
- best-case complexity
- Bible - searching the
- bibliographic databases
- biconnected components
- biconnected graphs
, , - big Oh notation
- bijection
- binary heap
- binary representation - subsets
- binary search
, , - binary search - applications
, - binary search - one-sided
, - binary search tree
, , , - binary search tree - applications
- binary search tree - computational experience
- Bin Packing
- bin packing - applications
, - bin packing - knapsack problem
- bin packing - related problems
, - biocomputing
- biology
- bipartite graph
- bipartite graph recognition
- bipartite incidence structures
- bipartite matching
, , , - bipartite matching - applications
, - bit-mapped images
- bit representation of graphs
- bit vector
, , , - bit vector - applications
, - blind man's algorithm
- block - set partition
- blossoms
- board evaluation function
- bookshelves
- Boolean logic minimization
, - Boolean matrix multiplication
- borrowing
- Boruvka's algorithm
- boss's delight
- boundaries
- bounded height priority queue
- bounding boxes
- Boyer-Moore algorithm
- brainstorming
- branch-and-bound search
, , - breadth-first search
, , , - breadth-first search - applications
- bridge
- bridges of Königsberg
- Brook's theorem
- Brooks, Mel
- brush fire
- brute-force search
- bubblesort
, - bucketing techniques
, , - bucketing techniques - graphics
- bucket sort
- budget, fixed
- built-in random number generator
- buying fixed lots
- C++
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , - C++ templates
- cache
- Caesar shifts
- calculator, arithmetic
- Calendrical Calculations
- call graph
, - canonically-labeled graphs
- canonical order
, , - CAP
- Carmichael numbers
- cars and tanks
- cartoons
- casino analysis
- casino poker
- catalog WWW site
- Catch-22 situation
- caveat
- CD-ROM
, , , - cdd
- center vertex
, , - CGAL
- chain of matrices
- characters
- checksum
- chessboard coverage
- chess program
, - Chinese calendar
- Chinese postman problem
- Chinese remainder theorem
- Christofides heuristic
- chromatic index
- chromatic number
- chromatic polynomials
- cipher
- circle
- circuit analysis
- circuit board assembly
- circuit board placement - simulated annealing
- circuit layout
- circuit schematic diagrams
- circuit testing
- circular embeddings
- C language
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , - classification
- classification - nearest-neighbor
- classifiers - neural networks
- clauses
- clipping
- Clique
- clique - applications
, - clique - definition
- clique - hardness proof
- clique - related problems
- clock
- closest pair heuristic
- closest pair problem
, - closest point
- closure
- clothing - manufacturing
- cloudy days
- cluster
- clustered access
- cluster identification
, , - clustering
, , - co-NP
- coding theory
- coefficients
- cofactor method
- coin flip
- collapsing dense subgraphs
- Collected Algorithms of the ACM
, , , , , , , , , , , , , , , , , , , , , - collection
- coloring graphs
- color interchange
- combinatorial generation algorithms
- combinatorial geometry
- combinatorial problems
, - Combinatorica
, , , , , , , , , , , , , , , , , , , , , , , , , , - Commentz-Walter algorithm
- commercial implementations
- committee
- committee - congressional
- Common Lisp
- common substrings
- communication in circuits
- communications networks
, - comp.graphics.algorithms
- comp.theory
- compaction
- comparisons - minimizing
- compiler
- compiler construction
- compiler optimization
, - compiler optimization - performance
- complement
- complement graph
- completion time - minimum
- complexity classes
- composite integer
- compress
, - compression
- compression - image
- computational biology
- computational complexity
- computational geometry
- computational number theory
, - computer algebra system
, - computer chess
- computer graphics
- computer graphics - applications
, - computer graphics - rendering
- computer vision
- concatenation - string
- concavities
- concavity elimination
- configurations
- configuration space
- conjugate gradient methods
- conjunctive normal form (CNF)
- connected components
, , , - connected components - related problems
, - connected graph
- connectivity
, , - consensus sequences
- consistent schedule
- Constrained and Unconstrained Optimization
- constrained and unconstrained optimization - related problems
- constrained Delaunay triangulation
- constrained optimization
- constrained optimization - related problems
- constraint elimination
- constraint satisfaction
- consulting services
, - container
, - context-free grammars
- Contig Assembly Program
- control systems - minimization
- convex decomposition
, - convex hull
, - Convex Hull
- convex hull - related problems
, - convex polygons
- convex polygons - intersection
- convex region
- convolution - polygon
- convolution - sequences
- cookbook
- cooling schedules
- coordinate transformations
- coplanar points
- copying a graph
- corporate ladder
- correctness - algorithm
- correlation function
- counterexample construction
- counting edges and vertices
- counting Eulerian cycles
- counting integer partitions
- counting linear extensions
- counting matchings
- counting paths
, - counting spanning trees
- courses, lecture notes
- covering polygons with convex pieces
- covering set elements
- CPLEX
- Cramer's rule
- CRC
- critical path method
- crossing number
- crossings
- Cryptography
- cryptography - keys
- cryptography - related problems
, , - CS
- CSA
- cubic regions
- currency speculation
- curve fitting
- Cuthill-McKee algorithm
- cut set
, - cutting plane methods
, - cutting stock problem
- CWEB
- cycle - shortest
- cycle breaking
- cycle detection
, - cycle length
- cycle notation
- cycle structure of permutations
- cyclic-redundancy check (CRC)
- DAG
- DAG - longest path in
- DAG - shortest path in
- data abstraction
- database algorithms
- database application
- database query optimization
- data compression
- Data Encryption Standard
- data filtering
- data records
- data structures
, - data structures - animations
- data transmission
- data validation
- Davenport-Schintzl sequences
, , - Davis-Putnam procedure
, - day of the week calculation
- deadlock
- de Bruijn sequence
, - debugging graph algorithms
- debugging parallel programs
- debugging randomized algorithms
- debugging time
- debugging tools
- decimal arithmetic
- decompose space
- decomposing polygons
- deconvolution
- decrease-key
- decryption
- Deep Blue
- defenestrate
- degeneracy
- degeneracy testing
- degenerate configuration
- degenerate system of equations
- degree, vertex
, - degree sequence
- degrees of freedom
- Delaunay triangulation
, , - Delaunay triangulation - applications
- deletion from binary search tree
- deletions - text
- deliveries and pickups
- delivery routing
- Democrat/Republican identification
- De Morgan's laws
- dense graphs
, , - densest sphere packing
- dense subgraph
- depth-first search
, , , , , , , , - depth-first search - applications
, , , , , - depth-first search - backtracking
- derangement
- derivatives - automata
- derivatives - calculus
- DES
- descendent
- design process
- design rule checking
- determinant
- determinant - related problems
- Determinants and Permanents
- deterministic finite automata
- DFA
- diameter of a graph
- diameter of a point set
- Dictionaries
- dictionaries - related problems
, - dictionary
, , - dictionary - applications
- dictionary - related problems
- dictionary - searching
- DIEHARD
- diff - how it works
- digital geometry
- digital signatures
- Dijkstra's algorithm
, , - DIMACS
, , - DIMACS Challenge data
- DIMACS Implementation Challenge
, , , , , - Dinic's algorithm
- directed acyclic graph
, , , - directed cycle
- directed graph
- directed graphs - automata
- directory file structures
- disclaimer
- discrete event simulation
, - Discrete Fourier Transform
, - discrete mathematics software
- discussion section
- disjoint paths
- disjoint set union
- disjoint subsets
- disjunctive networks
- disjunctive normal form
, - disk access
- disk drives
, - dispatching emergency vehicles
, - dispersion problems
- distance graph
- distance metrics
- distinguishable elements
- distributed computation
- distribution sort
, - divide and conquer
, , , , - division
, - DNA
- DNA sequence comparisons
- DNA sequencing
, , - dominance orderings
, - DOS file names
- double-precision arithmetic
, , - Douglas-Plucker algorithm
- drawing graphs - related problems
- Drawing Graphs Nicely
- drawing puzzles
- Drawing Trees
- drawing trees - related problems
, - driving time minimization
- drug discovery
- DSATUR
- dual graph
, - duality
, - duality transformations
- duplicate elimination
- duplicate elimination - graphs
- duplicate elimination - permutations
- duplicate keys
- dynamic convex hulls
- dynamic data structures
, - dynamic graph algorithms
- dynamic Huffman codes
- dynamic programming
, , , , , , , - dynamic programming - applications
, , - dynamic programming - initialization
- dynamic programming - shortest paths
- dynamic programming - space efficiency
- eavesdropper
- eccentricity of a graph
- economics - applications to
- edge/vertex connectivity - related problems
, , - Edge and Vertex Connectivity
- edge chromatic number
- edge coloring
, - edge coloring - applications
- edge coloring - related problems
, - edge cover
, , - edge disjoint paths
- edge flipping operation
- edge labeled graphs
- edge length
- edge tour
- edit distance
, - Edmond's algorithm
- efficiency of algorithms
- eight-queens problem
- electrical engineers
- electronic circuit analysis
- electronic circuits
- Electronic Frontier Foundation
- element uniqueness problem
, - elimination ordering
- ellipsoid algorithm
- elliptic-curve method
- embeddings - planar
- Emde Boas priority queue
- empirical results
, , - empirical results - heuristics
- empirical results - how to do
- empirical results - string matching
- employees to jobs - matching
- empty circle - largest
- empty rectangle
- enclosing boxes
- enclosing disk
- enclosing rectangle
- encryption
- energy function
- energy minimization
, - English language
, - English to French
- enumeration of spanning trees
- epsilon-moves
- equilateral triangle
- equivalence classes
- equivalence classes - automata states
- Erdős-Gallai conditions
- error
- estimating closure sizes
- ethnic groups in Congress
- Euclid's algorithm
- Euclidean minimum spanning tree
- Euclidean traveling salesman
- Euler's formula
- Eulerian cycle - applications
- Eulerian cycle - line graphs
- Eulerian cycle - related problems
, - Eulerian Cycle / Chinese Postman
- Eulerian path
- evaluation function
- even-degree vertices
- even-length cycles
- event queue
- evolutionary tree
- exact cover problem
- exact string matching
- exam scheduling
- exercises
, , , , , - exhaustive search
, - exhaustive search - application
- exhaustive search - empirical results
- exhaustive search - subsets
- expanded obstacles approach
- expander graphs
- expected-time, linear
- experimental analysis - set cover
- experimental graph theory
- exponential-time algorithms
, - exponential distribution
- exponentiation
, - export restrictions
- external-memory sorting
, - external memory
- facets
- facility location
, , - Factoring and Primality Testing
- factoring and primality testing - related problems
- factoring integers - related problems
- factory location
- family tree
, - fan out minimization for networks
- FAQ file
, , , - farthest point Voronoi diagrams
- Fary's theorem
- faster computers
- fast Fourier transform
- fat cells
- fattening polygons
- feature sets
- Federal Sentencing Guidelines
- feedback edge set
- Feedback Edge/Vertex Set
- feedback edge/vertex set - related problems
- Fermat
- Fermat's theorem
- Ferrer's diagram
- FFT
, - FFTPACK
- fgrep
- Fibonacci heap
, , , - Fibonacci numbers
- FIFO
- file difference comparison
- file directory trees
- file layout
- filtering outlying elements
- filtering signals
- final examination
- financial constraints
- find operation
- finite automata
- finite automata minimization
- finite element analysis
- Finite State Machine Minimization
- FIRE Engine
- firehouse
- first-fit - decreasing
- first in, first out
- fixed degree sequence graphs
- FLAP
- flat-earth model
- Fleury's algorithm
- flight crew scheduling
- floating-point arithmetic
- Floyd's algorithm
, , , - football program
- football scheduling
- Fortran
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , - Fortune's algorithm
- four-color problem
, - Fourier transform - applications
- Fourier transform - multiplication
- Fourier transform - related problems
- four Russians algorithm
, , - fragment ordering
- fraud - tax
- freedom to hang yourself
- free space
- free trees
- frequency distribution
- frequency domain
- friend-or-foe identification
- friendship graph
, - ftp - instructions
- function interpolation
- furniture moving
- furthest-point insertion heuristic
- furthest-site diagrams
- furthest-site Voronoi vertices
- future events
- game-tree search
- game-tree search - parallel
- games directory
- GAMS
, - gaps between primes
- garbage trucks
- Garey and Johnson
- Gates, William
- Gaussian distribution
, - Gaussian elimination
, - Genbank searching
- Generating Graphs
- Generating Partitions
- generating partitions - related problems
, , , - Generating Permutations
- generating permutations - related problems
, , , , - Generating Subsets
- generating subsets - applications
- generating subsets - related problems
, , , - genetic algorithms
, , , - Genocop
- geographic information systems
- Geolab
- geom.bib
, - geometric algorithms - animations
- geometric data structure
- geometric degeneracy
- geometric graphs
- geometric primitives - related problems
- geometric shortest path
, - geometric spanning tree
- geometric Steiner tree
- geometric traveling salesman problem
- geometric TSP
- GEOMPACK
, - Gettysburg Address
- Gibbs-Poole-Stockmeyer algorithm
- gift-wrapping algorithm
- Gilbert and Pollak conjecture
- Gingrich, Newt
- girth
, - glimpse
- global optimization
- Graffiti
- Graffiti - graphs of
, - Graham scan
- Grail
- graph algorithms
, - graph algorithms - animations
- graph algorithms - bandwidth problem
- GraphBase
, , , , , , , , , , , , , - graph complement
- graph data structures
, - graph data structures - applications
- graph data structures - LEDA
, - graph density
- graph drawings - clutter
- GraphEd
, , , - graph embedding
- graphical enumeration
- graphic partitions
- Graphics Gems
- graphics plotter
- graph isomorphism
, , - graph isomorphism - related problems
, - graph partition
, - Graph Partition
- graph partition - related problems
, , - graph products
- graphs
- graph theory
- graph theory packages
- graph traversal
- GraphViz
- Gray code
, - greatest common divisor
- greedy heuristic
, , , , , , - greedy heuristic - Huffman codes
- greedy heuristic - minimum spanning trees
- greedy heuristic - superstrings
- Gregorian calendar
- grid embeddings
- grid file
, - group - automorphism
- growth rates
- guarantees - importance of
- guarding art galleries
- Guide to Available Mathematical Software
- gzip
, - had-sex-with graph
, - half-space intersection
- Hamiltionian cycle - hypercube
- Hamiltonian cycle
, , , - Hamiltonian Cycle
- Hamiltonian cycle - applications
- Hamiltonian cycle - counting
- Hamiltonian cycle - hardness proof
- Hamiltonian cycle - line graphs
- Hamiltonian cycle - related problems
, - Hamiltonian path
- Hamiltonian path - applications
- Hamming distance
- hardness of approximation
- hardware arithmetic
- hardware design applications
- hardware implementation
- hash function
- hash tables
- hash tables - computational experience
- hash tables - size
- Hausdorff distance
- heap
- heapsort
, , , - heard-of graph
- heart-lung machine
- heating ducts
- Hebrew calendar
- Hertel-Mehlhorn heuristic
- heuristics
, , - heuristics - empirical results
- hidden-surface elimination
, - hierarchical decomposition
, - hierarchical drawings
- hierarchical graph structures
, - hierarchy
- high-precision arithmetic - need for
- high-precision arithmetic - related problems
, - higher-dimensional data structures
- higher-dimensional geometry
, , - high school algebra
- high school cliques
- hill climbing
- historical objects
- history
, - history - cryptography
- history - graph theory
- hitting set
- HIV virus
- homeomorphism
- homophones
- horizon
- Horner's rule
, - How to Solve It
- ht://Dig
- hub site
- Huffman codes
- Hull
- Human Genome Initiative
- Hungarian algorithm
- hypercube
, - hypergraph
, , - hyperlinks, WWW
- hyperplanes
- hypertext layout
- I_COLLIDE
- identical graphs
- IEEE Data Compression Conference
- image compression
, , , - image data
- image features
- image filtering
- image processing
- image segmentation
- image simplification
- implementation challenge, DIMACS
, - implementation challenges
, , , , , - implementation complexity
- implementations, caveats
- implementation wanted
- implicit binary tree
- impress your friends algorithms
- in-circle test
- incidence matrices
- inconsistent linear equations
- increasing subsequences
- incremental algorithms
- incremental change methods
- incremental insertion algorithm
- incremental insertion algorithms - arrangements
- incremental insertion algorithms - coloring
- incremental insertion algorithms - graph drawing
- incremental insertion algorithms - sorting
- incremental insertion algorithms - suffix trees
- incremental insertion algorithms - TSP
- independent set
, - independent set - alternate formulations
- independent set - hardness proof
- independent set - related problems
, , , - independent set - simulated annealing
- index - how to use
- induced subgraph
, - induced subgraph isomorphism
- induction for algorithm design
- inequivalence of programs with assignments
- information retrieval
- information theory
- input/output graphics
- insertion into binary search tree
- insertions - text
- insertion sort
, , , - inside/outside polygon
- instance - definition
- instance generator
- integer arithmetic
- integer factorization
, - integer partition
, , , - integer programming
- integer programming - applications
, - Integer programming - hardness proof
- integer programming - related problems
- integrality constraints
- interfering tasks
- interior-point methods
- Internal Revenue Service (IRS)
- Internet
, , - interpolation search
- intersection - halfspaces
- intersection - set
- Intersection Detection
- intersection detection - applications
- intersection detection - related problems
, - intersection point
- interview scheduling
- invariant - graph
- inverse Ackerman function
- inverse Fourier transform
- inverse matrix
, - inverse operations
- inversions
- Islamic calendar
- isolated vertex
- isomorphism
- isomorphism - graph
- isomorphism-complete
- iterative methods - linear systems
- jigsaw puzzle
- job-shop scheduling
- job matching
- Job Scheduling
- Journal of Algorithms
- JPEG
, - Julian calendar
- Königsberg
- k-subset - applications
- k-subsets
- Karatsuba's algorithm
- Karazanov's algorithm
- Karmarkar's algorithm
- Karp-Rabin algorithm
- Kd-Trees
, - kd-trees - applications
- kd-trees - related problems
, , - Kepler conjecture
- Kernighan-Lin heuristic
, - key length
, - key search
- Kirchhoff's laws
- knapsack
- knapsack problem
- Knapsack Problem
- knapsack problem - applications
- knapsack problem - related problems
- knight's tour problem
- Knuth-Morris-Pratt algorithm
- Kolmogorov complexity
- Kruskal's algorithm
, , , , - kth-order Voronoi diagrams
- kth-shortest path
- Kuratowski's theorem
- labeled graphs
, - labeling maps
- label placement
- labels
- language pattern matching
- LAPACK
, - large graphs - representation
- largest element
- last in, first out
- layered printed circuit boards
- Lazy adjacency matrix
- LCA - least common ancestor
- leap year
- least-squares curve fitting
- least common ancestor
- leaves - tree
- LEDA
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , - left-right test
- left-to-right ordering
- Lempel-Ziv algorithms
, - Lenstra's elliptic curve method
- lexicographic order
, , , - libraries
- licensing arrangements
- LIFO
- lifting-map construction
- line-point duality
- linear-time graph algorithms
- linear algebra
, - linear congruential generator
- linear constraint satisfaction
- linear extension
- linear interpolation search
- linear partitioning
- linear programming
- Linear Programming
- linear programming - models
- linear programming - related problems
, - linear programming - relaxation
- linear programming - special cases
- line arrangements
- line graph
, - line intersection
, - line segment intersection
- line segment Voronoi diagram
- LINK
, - link distance
, - linked lists vs. arrays
, - LINPACK
, , - LISP
- list searching
- literate program
- locality of reference
, - local optima
- locations
- logarithms
, - logic minimization
- logic problems
- logic programming
- long division
- longest common prefix
- longest common substring
, - longest common substring - related problems
, - longest cycle
, - longest increasing subsequence
, - longest path
, - longest path - DAG
- long keys
- loop
, - lossless encodings
- lossy encodings
- lottery problems
- Lotto problem
- low-degree spanning tree
, - low-dimensional linear programming
- lower bound
, , , - lower bound - range searching
- lower bound - sorting
- lower triangular matrix
- lp_solve
- LU-decomposition
, - lunar calendar
- LZW algorithm
, - machine-independent random number generator
- machine clock
- Macsyma
- mafia
- magnetic tape
- mail routing
- maintaining arrangements - related problems
, - Maintaining Line Arrangements
- makeg
- manufacturing applications
, - map labeling
- Maple
- map making
- marriage problems
- MAT
, - matching
, - matching - applications
- matching - dual to
- matching - number of perfect
- matching - related problems
, , , , - matching shapes
- Mathematica
, , , , , , , , , , , , , , , , , , , , , , , , , , , - mathematical notation
- mathematical programming
, - mathematical software - netlib
- matrix-tree theorem
- matrix bandwidth
- matrix compression
- matrix inversion
, - matrix multiplication
- Matrix Multiplication
- matrix multiplication - applications
- matrix multiplication - related problems
- matroids
- max-cut
- max-flow, min-cut theorem
- maxima
- maximal clique
- maximal matching
- maximum-cardinality matchings
- maximum acyclic subgraph
- maximum cut - simulated annealing
- maze
, - McDonald's restaurants
- MD5
- mean
- Mechanical computers
- mechanical truss analysis
- medial-axis transform
, - Medial-Axis Transformation
- median - application
- Median and Selection
- medical residents to hospitals - matching
- memory accesses
- mems
- Menger's theorem
- mergesort
, , , - merging subsets
- merging tapes
- mesh generation
, - Metaphone
- Metropolis algorithm
- middle square method
- millennium bug
- Miller-Rabin algorithm
- mindset
- minima
- minimax search
- minimizing automata
- minimum-change order
- minimum change order - subsets
- minimum cut
- minimum equivalent digraph
- minimum spanning tree
, , , , - Minimum Spanning Tree
- minimum spanning tree - applications
, - minimum spanning tree - drawing
- minimum spanning tree - related problems
, , - minimum weight triangulation
- Minkowski metric
- Minkowski sum
, - Minkowski sum - applications
- Minkowski sum - related problems
, - MIX assembly language
- mixed-integer programming
- mixed graphs
- mode
, - mode-switching
- modeling
- modeling algorithm problems
- modeling graph problems
- models of computation
- Modula-3
- modular arithmetic
- molecular docking
- molecular sequence data
- Mona Lisa
, - monotone decomposition
- monotone polygons
- Monte Carlo techniques
, - month and year
- morphing
- motion planning
- Motion Planning
- motion planning - related problems
, , - motion planning - shape simplification
- mountain climbing
- move to front rule
, - moving furniture
- MPEG
, - multicommodity flow
- multigraph
- multiple knapsacks
- multiple precision arithmetic
- multiple sequence alignment
- multiplication
, - multiplication, matrix
- multiplication algorithms
- multiset
, - musical scales
- name variations, recognizing
- naming concepts
- nanosecond
- national debt
- National Football League (NFL)
- National Security Agency (NSA)
- nauty
, - NC - Nick's class
- nearest-neighbor heuristic
- nearest neighbor - related problems
- nearest neighbor graph
, - nearest neighbor search
, , - nearest neighbor search - related problems
, - negation
- negative-cost cycle
- negative cost edges
- NEOS
, - Netlib
, , , , , , , , , , , - network
- Network-Enabled Optimization System
- network design
, , - network design - minimum spanning tree
- network flow
, - Network Flow
- network flow - applications
, - network flow - related problems
, , , , - network reliability
, - neural networks
- neural networks - classification
- neural networks - coloring
, - newsgroups
- next subset
- Nobel Prize
, - noisy channels
- noisy images
, - nonapproximability results
- noncrossing drawing
- nondeterministic automata
- nonEuclidean distance metrics
- nonnumerical problems
- nonorthogonal kd-tree
- nonself intersecting polygons
- nonuniform access
- normal distribution
- notorious NP-complete problem
- NP
, - NP-completeness
- NP-completeness - definition of
- NP-completeness - proving
- NP-completeness - theory of
- NP-complete problem
, , , - NP-complete problem - bandwidth
- NP-complete problem - crossing number
- NP-complete problem - NFA minimization
- NP-complete problem - satisfiability
- NP-complete problem - set packing
- NP-complete problem - superstrings
- NP-complete problem - tetrahedralization
- NP-complete problem - tree drawing
- NP-complete problem - trie minimization
- NP-hard problems
- nuclear fission
- number field sieve
- number theory
, - numerical analysis
- numerical precision
- Numerical Recipes
, - numerical root finding
- numerical stability
, - O-notation
- objective function
- obstacle-filled rooms
- OCR
- octtree
- odd-degree vertices
- odd-length cycles
, - off-line problem
- oligonucleotide arrays
- on-line algorithm resources
- on-line problem
- one-sided binary search
, - OpenGL graphics library
- operations research
, - optical character recognition
, , , - optical character recognition - system testing
- optimal binary search trees
- optimization problems
- ordered set
- ordering
, - order statistics
- organic graphs
- organ transplant
- orthogonal planes
- orthogonal polyline drawings
- orthogonal range query
, - outerplanar graphs
- outlying elements
- output-sensitive algorithms
- overdetermined linear systems
- overlap graph
- overpasses - highway
- Oxford English Dictionary
- P
- P-completeness
- p-tree
- packaging
- packaging applications
- packing vs. covering
- paging
, - pagoda
- pairing heap
, - palindrome
- paradigms of algorithms design
- parallel algorithms
, - parallel algorithms - graphs
- parallel algorithms - visualization
- parallel lines
- parallel processor scheduling
- paranoia level
- parenthesization
- PARI
, - parse trees
- parsing
- partial key search
- partial order
, - partitioning automata states
- partitioning point sets
- partitioning polygons into convex pieces
- partitioning problems
- partition problem
- party affiliations
- Pascal
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , - password
, - patented algorithms
- path
- path generation - backtracking
- path planning
- paths - counting
, - Patricia trie
- pattern matching
, , , - pattern recognition
, - pattern recognition - automata
- patterns
- Pat tree
- PDF-417
- penalty functions
- perfect hashing
- perfect matching
- performance bottlenecks
- performance guarantee
- performance in practice
- period
- periodicities
- perl
- permanent
- permutation
, - permutation comparisons
- permutation generation
- permutation generation - backtracking
- perpendicular bisector
- personality conflicts - avoiding
- PERT/CPM
- Petersen graph
- PGP
, , - phone company
- PHYLIP
- phylogenic tree
, - piano mover's problem
- Picasso, P.
, - pieces of a graph
- pilots
- pink panther
- pivoting rules
, - pixel geometry
, - pLab
- planar drawings
, - planar drawings - related problems
- planar graph
, - planar graph - clique
- planar graph - coloring
- planar graph - instances
- planar graph - isomorphism
- Planarity Detection and Embedding
- planarity testing - related problems
- planar separators
- planar subdivisions
- planar sweep algorithms
- plumbing
- point-spread function
- point distributions
- pointer manipulation
- point in polygon
- point location
, - point location - related problems
, , , - point robots
- points
- point set clusters
- Poisson distribution
- Polka
- polygonal data structure
- Polygon Partitioning
- polygon partitioning - related problems
- polygons
- polygon triangulation
- polyhedral simplification
- polyline graph drawings
- polynomial-time approximation scheme
- polynomial-time problems
- polynomial evaluation
- polynomial multiplication
- poor thin people
- popular keys
- porting code
- POSIT
- positions
- position tree
- potential function
- power diagrams
- power set
- powers of graphs
- Prüfer codes
, - precedence-constrainted scheduling
- precedence constraints
, - precision
- preemptive scheduling
- prefix - string
- preflow-push methods
- preprocessing - graph algorithms
- presortedness measures
- Pretty Good Privacy
- previous subset
- PRF
- price-per-pound
- Prim's algorithm
, - primality testing
, - prime number
- prime number theorem
- principle of optimality
- printed circuit boards
, - printing a graph
- priority queues
, - priority queues - applications
, , , , - priority queues - arithmetic model
- priority queues - related problems
- problem - definition
- problem-specific algorithms
- problem descriptions
- problem instance
- problem solving techniques
, - procedure call overhead
- producer/consumer sectors
- profit maximization
- Program Evaluation and Review Technique
- program libraries
- programming languages
- programming time
, - program structure
- Prolog
- proof of correctness
- propagating consequences
- propositional logic
- protocol
- pruning - backtracking
, , - pseudocode
- pseudorandom numbers
- psychic lotto prediction
- public key cryptography
, , - Qhull
, , , - quadratic-sieve method
- quadratic programming
- quadtree
- quality triangulations
- questions
- queue
, - queue - applications
- quicksort
, , , - quicksort - applications
- rabbits
- radial embeddings
- radio stations
- radius of a graph
- radix sort
, - RAM
- RAM model of computation
- Random Access Machine (RAM)
- random generation - testing
- random graph theory
, - random graphs - generation
- randomization
- randomized algorithms
, , , , - randomized data structures
- randomized incremental algorithms
, , , - randomized quicksort
- randomized search - applications
- random number generation
, , - random number generation - related problems
- random permutations
, - random perturbations
- random sampling - applications
- random search tree
- random subset
- Ranger
, , - range search
, , - range search - related problems
, - ranked embedding
- ranking and unranking operations
, , - ranking combinatorial objects
- ranking permutations
- ranking subsets
- RAPID
- rasterized images
- rational arithmetic
- ray shooting
- reachability problems
- rebalancing
- recommendations, caveat
- rectangle
- rectilinear Steiner tree
- recurrence relations
- recurrence relations - evaluation
- recursion - applications
- red-black tree
- reduction
, - reduction - direction of
- reflex vertices
- region of influence
- regions
- regions formed by lines
- register allocation
- regular expressions
, - relationship
- reliability, network
- repeated vertices
- representative selection
- Republican sex offenders
- resource allocation
, - resources - algorithm
- restricted growth function
- retrieval
, - reverse-search algorithms
- Right Stuff, The
- riots ensuing
- Rivest-Shamir-Adelman
- road network
, , - robot assembly
, - robot motion planning
, , - robust geometric computations
- Robust Geometric Primitives
- Roget's Thesaurus
, - rooted tree
, - root finding algorithms
, , - rotating-calipers method
- rotation
- rotation - polygon
- roulette wheels
- round-off error
- round-off errors
- RSA-129
- RSA algorithm
, , - rules of algorithm design
- run-length coding
- s-t connectivity
- safe cracker sequence
- satisfiability
, - satisfiability - related problems
, - satisfying constraints
- sato
- scaling
, - scanner, OCR
- scattered subsequences
- scene interpolation
- scheduling
, - scheduling - precedence constraints
- scheduling - related problems
, , - scheduling problems
- Scheme
, - schoolhouse method
- sci.math
- scientific computing
, , - Searching
- searching - related problems
, - search space
- search time minimization - magnetic media
- search tree
, - secondary key
- secondary storage devices
- secure hashing function
- security
, - seed
- segmentation
, - segment intersection
- selection
, , - selection - subsets
- selection sort
, - self-intersecting polygons
- self-organizing list
, - self-organizing tree
, - self-study textbook
- semi-exhaustive greedy algorithm
- semidefinite programming
- sentence structure
- separation problems
- separator theorems
- sequence
- sequencing by hybridization
- sequencing permutations
- sequential search
, - set
- set algorithms
- Set Cover
, , - set cover - applications
- set cover - exact
- set cover - related problems
, , , - Set Data Structures
, - set data structures - applications
- set data structures - related problems
- Set Packing
, - set packing - related problems
, - set partition
, - sex offenders, Republican
- shape of a point set
- shape representation
- shapes
- Shape Similarity
- shape simplification
- shape simplification - applications
, - shellsort
, - Shifflett
- shift-register sequences
- shipping applications
- shipping problems
- Shortest Common Superstring
- shortest common superstring - related problems
, - shortest cycle
- shortest path
, , , - Shortest Path
- shortest path - applications
, - shortest path - definition
- shortest path - geometric
, - shortest path - related problems
, , , , , , - shortest path matrix
- shotgun sequencing
- shuffling
- sieving devices - mechanical
- SIGACT
- sign - determinant
- sign - permutation
- signal processing
- signal propagation minimization
- Sim++
, - SimPack
, - simple cycle
- simple graph
- simple polygon - construction
- simple polygons
- simplex method
- simplicial complex
- simplicity testing
- simplification envelopes
- Simplifying Polygons
- simplifying polygons - related problems
- simulated annealing
, , , , , , , , , , , - simulated annealing - satisfiability
- simulated annealing - theory
- simulations
- simulations - accuracy
- sin, state of
- sine functions
- single-precision numbers
, - single-source shortest path
- singular matrix
, - sinks - multiple
- sink vertex
- sites
- size of graph
- skeleton
, - skewed distribution
- Skiena, Len
, - skiing
- skinny triangles
- skip list
- slab method
- slack variables
- small edge weights
- smallest element
- smallest enclosing circle problem
- Smith Society
- smoothing
, - smoothness
- SNNS
- snow plows
- soap films
- software engineering
- software tools
- solar year
- Solving Linear Equations
- solving linear equations - related problems
, , - sorted array
, - sorted linked list
, - sorting
, , - sorting - applications
- sorting - animations
- sorting - applications
, - sorting - cost of
- sorting - rationales for
- sorting - related problems
, , , , , - sorting - strings
- sound-alike strings
- Soundex
, - sources - multiple
- source vertex
- space-efficient encodings
- space decomposition
- space minimization - digraphs
- space minimization - string matching
- spanning tree
- SPARE Parts
- sparse graph
, , - sparse matrices
- sparse matrices - compression
- sparse subset
- sparse systems
- sparsification
- spatial data structure
- special-purpose hardware
- speech recognition
- speedup - parallel
- spelling correction
, , - sphere packing
- spikes
- Spinout puzzle
- spiral polygon
- splay tree
, - SPLIB
- splicing cycles
- splines
- split-and-merge algorithm
- spreadsheet updates
- spring embedding heuristics
, - square of a graph
, - square root of a graph
- square roots
- stable marriages
, - stable sorting
- stack
, - stack - applications
- stack size
- standard form
- Stanford GraphBase
, , , - star-shaped polygon decomposition
- state elimination, automata
- static tables
- statistical significance
- statistics
- steepest descent methods
- Steiner points
- Steiner ratio
- Steiner Tree
- Steiner tree - related problems
- Steiner vertices
- stock exchange
- stock picking
- Stony Brook Algorithm Repository
- Stony Brook class projects
, - straight-line graph drawings
, - Strassen's algorithm
, , , , - strategy
- strength of a graph
- string
- string algorithms
- string algorithms - animations
- string data structures
, , - String Matching
, - string matching - related problems
, , , - string overlaps
- strings
- strings - combinatorial
- strings - generating
- strongly-connected graphs
- strongly connected components
- strongly connected graphs
, - Stuttgart Neural Network Simulator
- subgraph isomorphism
- subgraph isomorphism - applications
- subroutine call overhead
, - subset
- subset generation
- subset generation - backtracking
- subset sum problem
- substitution cipher
- substitutions, text
- substring matching
, - subtraction
- suffix array
- suffix trees
, , - suffix trees - applications
, - suffix trees - computational experience
- suffix trees - related problems
, - Suffix Trees and Arrays
- sunny days
- supercomputer
- superstrings - shortest common
- surface interpolation
- surface structures
- swap elements
- swapping
- sweepline algorithms
, , - symbolic computation
- symbolic set representation
- Symbol Technologies
- symmetric difference
- symmetry detection
- symmetry removal
- tables
- tabu search
- tactics
- tail recursion
- take home lessons
- tape drive
- tax fraud
- taxonomy
- technical skills
- telephone books
, , - telephone dialing
- terrorist
, - test data
- testing planarity
- test pilots
- tetrahedralization
- text
- textbooks
, - text compression
, - Text Compression
- text compression - related problems
, , - text data structures
, - text processing algorithms
- text searching with errors
- thermodynamics
- thinning
- thinning - applications
- thinning - related problems
, - three-points-on-a-line
- tight bound
- time-series analysis
- time slot scheduling
- Toeplitz matrices
- tool path optimization
- topological sorting
, - topological sorting - applications
, - topological sorting - related problems
, , , - topological sweep
- tour
- traffic light scheduling
- transition matrix
- transitive closure
- Transitive Closure and Reduction
- transitive reduction
- translation - polygon
- transmitter power
- transportation problems
, , - transposition
- trapezoidal decomposition
- traveling salesman
, , - traveling salesman - applications
, - traveling salesman - approximation algorithms
- traveling salesman - decision problem
- traveling salesman - dynamic programming
- traveling salesman - related problems
, , - traveling salesman - simulated annealing
- Traveling Salesman Problem
- treap
- tree identification
- trees
, - trees - acyclic graphs
- trees - detection
- trees - drawings
- trees - generation
- trees - hard problem in
- trees - independent set
- trees - matching
- trees - partition
- trial division
- Triangle
- triangle inequality
, - triangle refinement method
- triangle strips
, - triangulated surfaces
- Triangulation
- triangulation - applications
, , , - triangulation - minimum weight
- triangulation - related problems
, - triconnected components
- trie
, - trigram statistics
- TSP
- tsp_solve
- TSPLIB
, - turnpike reconstruction problem
- twenty questions
- two-coloring
- unbounded search
, - unconstrained optimization
, , - unconstrained optimization - related problems
- undirected graph
- uniform distribution
, , - union, set
- union-find data structure
- union-find data structure - applications
- union of polygons
- union of polygons - applications
- unit cube
- unit sphere
- universal set
- unknown data structures
- unlabeled graphs
, - unranking combinatorial objects
- unranking permutations
- unranking subsets
- unsorted array
- unsorted list
- unweighted graphs - spanning trees
- upper bound
- upper triangular matrix
- Utah
- validation
- Vancouver Stock Exchange
- Vandermonde matrices
- vantage point tree
- variable elimination
- variable length encodings
- vector quantification
- vector sums
- Vertex Coloring
, , , - vertex coloring - applications
- vertex coloring - bipartite graphs
- vertex coloring - related problems
, , - vertex cover
, - vertex cover - approximation algorithm
- vertex cover - hardness proof
, - vertex cover - related problems
, , - vertex degree
, - vertex disjoint paths
- video - algorithm animation
- video compression
, - virtual memory
, , - virtual memory - algorithms
- virtual memory - performance
- virtual reality applications
- visibility graphs
, - Viterbi algorithm
- Vizing's theorem
, - VLSI circuit layout
, - VLSI design problems
- volume computations
, - von Emde Boas queue
- von Neumann, J.
- Voronoi diagram
- Voronoi Diagrams
- Voronoi diagrams - nearest neighbor search
- Voronoi diagrams - related problems
, , , , - walk-through
- Waring's problem
, - Warshall's algorithm
- war story
, , , , , , , , , - water pipes
- wavelets
- weakly-connected graphs
, - web
- weighted graphs, applications
- Winograd's algorithm
- wire length minimization
- wiring layout problems
- word ladders
, - worker assignment - scheduling
- world's record TSP
- worst-case complexity
- WWW site
- X-windows
- Xerox machines - scheduling
- XRLF
- XTango
, , , , , , , , , , , , , , , , , , , - Young tableaux
- zero-knowledge proofs
- Zipf's law
- zone theorem
,
Algorithms
Tue Jun 3 11:59:38 EDT 1997