Combinatorial AlgorithmsRandall Rustin |
Common terms and phrases
1-factor a₁ adjacency matrices algorithm for constructing array assigned basic unit Bi(k bichromatic binary trees block Cayley table columns combinatorial comparisons Computer Science connected component containing corresponding Cutting Stock Problem defined denote edge color edge of color edge-coloring elements entries example expected number Figure finite first-fit given groupoid Hamiltonian cycle Hibbard's sequence hole initial run insertion insertion sorting integer intersection problem inverse k-parity problem Knuth Lemma lower bound merge step monochromatic triangles multiplication NFF/No NFFD nodes number of operations optimal pair parity set partition matroids passengers permutation polynomial-bounded algorithm proof Ramsey Numbers Ramsey's Theorem random Boolean matrix rank group regular coloring result rithm root S₁ semigroup Shellsort spanning tree subgraph subsets symmetric sum-free sets tape template Theorem tion transitive closure trichromatic triangles triples University upper bound valence values vertex vertices weighted path length Whitehead