Graph Isomorphism and Identification Matrices: Parallel Algorithms

In this paper, we explore some properties of identification matrices and exhibit some uses of identification matrices in studying the graph isomorphism problem, a famous open problem. We show that, given two graphs in the form of a certain identification matrix, isomorphism can be tested efficiently in parallel if at least one matrix satisfies the circular 1s property, and more efficiently in parallel if at least one matrix satisfies the consecutive 1s property. Graphs which have identification matrices satisfying the consecutive 1s property include, among others, proper interval graphs and doubly convex bipartite graphs. The result presented here substantially broadens the class of graphs for which there are known efficient parallel isomorphism testing algorithms.

[1]  Gary L. Miller,et al.  Parallel Tree Contraction, Part 2: Further Applications , 1991, SIAM J. Comput..

[2]  Lin Chen,et al.  Parallel Recognition of the Consecutive Ones Property with Applications , 1991, J. Algorithms.

[3]  L. Chen.  Efficient parallel algorithms for several intersection graphs , 1989, IEEE International Symposium on Circuits and Systems,.

[4]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[5]  Xin He,et al.  Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs , 1987, Inf. Comput..

[6]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[7]  A. Tucker,et al.  Matrix characterizations of circular-arc graphs , 1971 .

[8]  Lin Chen.  NC Algorithms for Circular-Arc Graphs , 1989, WADS.

[9]  Lin Chen.  Parallel graph isomorphism detection with identification matrices , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

[10]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

[11]  Christoph M. Hoffmann,et al.  Group-Theoretic Algorithms and Graph Isomorphism , 1982, Lecture Notes in Computer Science.

[12]  Fanica Gavril,et al.  Algorithms on circular-arc graphs , 1974, Networks.

[13]  Shietung Peng,et al.  Parallel Algorithms for Cographs and Parity Graphs with Applications , 1990, J. Algorithms.

[14]  Sartaj Sahni,et al.  A parallel matching algorithm for convex bipartite graphs and applications to scheduling , 1984, J. Parallel Distributed Comput..

[15]  Lin Chen.  Revisiting Circular Arc Graphs , 1994, ISAAC.

[16]  Kellogg S. Booth,et al.  Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems , 1978, SIAM J. Comput..

[17]  J. Reif,et al.  Parallel Tree Contraction Part 1: Fundamentals , 1989, Adv. Comput. Res..

[18]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[19]  Lin Chen,et al.  Efficient parallel algorithms for bipartite permutation graphs , 1993, Networks.

[20]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[21]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[22]  Richard C. T. Lee,et al.  Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs , 1988, Inf. Process. Lett..

[23]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..