Subcomplete generalizations of graph isomorphism
type: Item
instance of: scholarly article
title: Subcomplete generalizations of graph isomorphism
zbMATH Open document ID: 0508.68044
DOI: 10.1016/0022-0000(82)90015-0
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20B25
zbMATH DE Number: 3802826
zbMATH Keywords: graph isomorphism
zbMATH Keywords: computational complexity
zbMATH Keywords: isomorphism complete
zbMATH Keywords: group intersection
author: Christoph M. Hoffmann
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90015-0
OpenAlex ID: W2031113708
cites work: Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
cites work: Constructive graph labeling using double cosets
cites work: Q3912839
cites work: Q4198056
cites work: Q3253828
cites work: A V log V algorithm for isomorphism of triconnected planar graphs
cites work: Q4148000
cites work: On the Structure of Polynomial Time Reducibility
cites work: Some NP-Complete Problems Similar to Graph Isomorphism
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Computing the composition factors of a permutation group in polynomial time
cites work: A note on the graph isomorphism counting problem
cites work: On the nlog n isomorphism technique (A Preliminary Report)
cites work: Q5666716
cites work: Q3895641
cites work: The complexity of computing the permanent
cites work: Q5512231
cites work: Q4154737
description: scientific article; zbMATH DE number 3802826