Graph isomorphism and identification matrices: Sequential algorithms

DOI10.1006/jcss.1999.1642zbMath0958.68137OpenAlexW1973860121MaRDI QIDQ1970201

Lin Chen

Publication date: 9 April 2001

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1642

zbMATH Keywords

adjacency matricesidentification matrices

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient parallel recognition of some circular arc graphs. II
• Bipartite permutation graphs
• Group-theoretic algorithms and graph isomorphism
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Efficient parallel recognition of some circular arc graphs. I
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• Matrix characterizations of circular-arc graphs
• Parallel recognition of the consecutive ones property with applications
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• The graph isomorphism disease
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
• Efficient parallel algorithms for bipartite permutation graphs
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Graph isomorphism and identification matrices: Sequential algorithms