A nonfactorial algorithm for testing isomorphism of two graphs
type: Item
instance of: scholarly article
title: A nonfactorial algorithm for testing isomorphism of two graphs
zbMATH Open document ID: 0529.05059
DOI: 10.1016/0166-218X(83)90078-1
author: Mark K. Goldberg
published in: Discrete Applied Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3840016
zbMATH Keywords: nonfactorial algorithm
zbMATH Keywords: graph-isomorphism-problem
zbMATH Keywords: branch-and-bound technique
MaRDI profile type: Publication
cites work: On the Complexity of Canonical Labeling of Strongly Regular Graphs
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Q5183518
cites work: Q4190142
cites work: A V log V algorithm for isomorphism of triconnected planar graphs
cites work: Q3719847
full work available at URL: 0166-218x(83)90078-1
OpenAlex ID: W1978159333
description: scientific article; zbMATH DE number 3840016