Abstract
A selected tour of the theory of identification matrices is offered here. We show that shortest-path adjacency matrices are identification matrices for all simple graphs and adjacency matrices are identification matrices for all bipartite graphs. Additionally, we provide an improved proof that augmented adjacency matrices satisfying the circular 1's property are identification matrices. In passing, we present a matrix characterization of doubly convex bipartite graphs. As an application of the theory of identification matrices, we describe an improved method for testing isomorphism of Γ circular arc graphs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335–379, 1976.
L. Chen. Parallel graph isomorphism detection with identification matrices. In S. Horiguchi, D. F. Hsu, and M. Kimura, editors, Proc. Int'l Symp. on Parallel Architectures, Algorithms and Networks, pages 105–112. IEEE, 1994.
L. Chen. Sequential graph isomorphism detection with identification matrices. In Proceedings, 4th International Conference for Young Computer Scientists, 1995.
L. Chen. Graph isomorphism and identification matrices: Parallel algorithms. IEEE Transactions on Parallel and Distributed Systems, 7(3):308–319, March 1996.
L. Chen. Efficient parallel recognition of some circular arc graphs, II. Algorithmica, 17(3):266–280, March 1997.
L. Chen and Y. Yesha. Parallel recognition of the consecutive ones property with applications. J. Algorithms, 12(3):375–392. September 1991.
L. Chen and Y. Yesha. Efficient parallel algorithms for bipartite permutation graphs. Networks, 23(1):29–39, January 1993.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., San Francisco, 1979.
W.-L. Hsu. O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM Journal on Computing, 24(3):411–439, June 1995.
R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations. Plenum Press, New York, 1972.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 869–941. North Holland, Amsterdam, 1990.
G. S. Lueker and K. S. Booth. A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM, 26(2):183–195, April 1979.
F. S. Roberts. Representations of Indifference Relations. PhD thesis, Stanford University, 1968.
T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Information Processing Letters, 43(4):195–199, September 1992.
A. C. Tucker. Matrix characterization of circular-arc graphs. Pacific J. Math., 39(2):535–545, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L. (1997). A selected tour of the theory of identification matrices. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045089
Download citation
DOI: https://doi.org/10.1007/BFb0045089
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive