Graph isomorphism and identification matrices: Sequential algorithms
type: Item
instance of: scholarly article
title: Graph isomorphism and identification matrices: Sequential algorithms
zbMATH Open document ID: 0958.68137
author: Lin Chen
published in: Journal of Computer and System Sciences
publication date: 2001-04-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1417881
zbMATH Keywords: identification matrices
zbMATH Keywords: adjacency matrices
MaRDI profile type: Publication
full work available at URL: jcss.1999.1642
OpenAlex ID: W1973860121
cites work: Q4773298
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Efficient parallel recognition of some circular arc graphs. I
cites work: Efficient parallel recognition of some circular arc graphs. II
cites work: Parallel recognition of the consecutive ones property with applications
cites work: Efficient parallel algorithms for bipartite permutation graphs
cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
cites work: Q3327728
cites work: Incidence matrices and interval graphs
cites work: Q4198056
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3328583
cites work: Group-theoretic algorithms and graph isomorphism
cites work: Q4148000
cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
cites work: Q4142699
cites work: Q4273947
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: The graph isomorphism disease
cites work: Bipartite permutation graphs
cites work: Matrix characterizations of circular-arc graphs
DOI: 10.1006/JCSS.1999.1642
description: scientific article; zbMATH DE number 1417881