The graph isomorphism problem—to devise a good algorithm for determining if two graphs
are isomorphic—is of considerable practical importance, and is also of theoretical interest …

W e develop an improved a. lgon'thm for ca. nonically la. belling a graph a. nd finding
generators for its automorph. ism grou. p. The emphasis i, on th. e power of the algorithm for …

Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular
graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …

Recall that the distance of a vertex u from a vertex v in the graph X is the length of a shortest
path between u and v. Similarly, if e=(vl, v2) is an edge of X, we define the distance of a …

1.1 A balanced incomplete block design (BIBD) is a pair (V, B) where V is a v-set and B is a
collection of bk-subsets of V (blocks) such that each element of V is contained in exactly r …

Strongly regular graphs lie at the intersection of statistical design, group theory, finite
geometry, information and coding theory, and extremal combinatorics. This monograph …

This paper considers a parallel algorithm for Bayesian network structure learning from large
data sets. The parallel algorithm is a variant of the well known PC algorithm. The PC …

Tarjan has given an algorithm for deciding isomorphism of two groups of order n (given as
multiplication tables) which runs in O (n (log2n+ O (1)) steps where n is the order of the …

Publisher Summary A two-graph (Ω, Δ) is a vertex set Ω and a collection Δ of 3-subsets of Ω
such that every 4-subset of Ω contains an even number of 3-subsets from Δ. The two-graph …

Symmetry often appears in real-world constraint satisfaction problems, but strategies for
exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry …