9 pages matching fast algorithms in this book
Results 1-3 of 9
What people are saying - Write a review
We haven't found any reviews in the usual places.
6TH S-E CONF adjacency matrix adjacent assume automorphism bipartite block Boolean bound chromatic polynomial Combinatorial Theory COMPUTING conjecture construct Corollary corresponding cubes cyclic defined Definition denote difference set digraph directed graph disjoint elements endvertex equation exactly example exists fast algorithms finite function given graph G GRAPH THEORY hamiltonian hamiltonian path Hence induced integer interval graph isomorphic labeled Latin Squares least Lemma length Let G line dipseudograph linear Math matrix minimal multiplicity node number of edges obtained orbits order-v/2 subsystems pair paper parameters partition patterns permutation planar graph points polynomial problem PROC Proof quadruple system register allocation result satisfies simple paths special planar Steiner triple systems Step subgraph subset Suppose symbol Theorem toroidal graphs tournament tree triangles triple systems vertex vertices weighing matrix Wh[v