Related articles:
NP-complete
Key terms:
minimum
subgraph
partition
scheduling
weighted
kth
minimize
matching
sequencing
spanning tree
assignment
shortest
hamiltonian
optimal
bounded
clique
ordering
knapsack
dominating set
bipartite
planar
coloring
miscellaneous
constrained
quadratic
packing
steiner tree
isomorphic
code generation
traveling salesman
integral flow
disjoint
automata
divisibility
deadlines
graph theory
satisfiability
conjunctive
path problem
augmentation
sequencing to minimize
minimum weight
multiple choice
fault detection
hamiltonian path
consecutive ones
minimize weighted
linear arrangement
linear programming
hamiltonian circuit
Search external links cited by footnotes on Wikipedia page List of NP-complete problems:
|
|