Combinatorial Algorithms: Theory and Practice |
Contents
REPRESENTATION OF COMBINATORIAL OBJECTS | 32 |
COUNTING AND ESTIMATING | 71 |
EXHAUSTIVE SEARCH | 106 |
Copyright | |
6 other sections not shown
Common terms and phrases
a₁ adjacency asymptotic average search B₁ back edge backtrack balanced binary search tree binary tree c₁ Chapter cliques codeword combinatorial computation consider contains corresponding cycle d₁ decision tree deletion depth-first search determine digraph elements embedding equation example Exercise extended binary tree graph G Gray code hash function height-balanced height-balanced trees insertion integers internal nodes isomorphic label largest name linear loop Lower bound lowpt m₁ matrix merging name comparisons name space NP-complete NP-hard number of name optimal tree p₁ partition path length permutations planar pointer polynomial Prove quicksort random recurrence relation recursive representation requires result root S₁ Section segment sequence sequential shortest path shown in Figure shows sieve solution sorting algorithms spanning tree stack strongly connected component subgraph subset subtables T₁ techniques Theorem tour traveling salesman problem traversed undirected graph v₁ vector vertex vertices weighted path length weights x₁ π₁