Graph isomorphism and identification matrices: Sequential algorithms

DOI10.1006/JCSS.1999.1642zbMATH Open0958.68137OpenAlexW1973860121MaRDI QIDQ1970201FDOQ1970201

Authors: 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

Recommendations

• A selected tour of the theory of identification matrices
• Graph algebras and the graph isomorphism problem
• scientific article; zbMATH DE number 1839469
• Isomorphism of graph classes related to the circular-ones property
• Adjacency Matrices

zbMATH Keywords

adjacency matricesidentification matrices

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• On the recognition of isomorphism of bipartite graphs
• Isomorphism of graph classes related to the circular-ones property
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
• Isomorphism identification of graphs: especially for the graphs of kinematic chains
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970201)