Graph isomorphism, general remarks
type: Item
instance of: scholarly article
title: Graph isomorphism, general remarks
zbMATH Open document ID: 0403.03029
DOI: 10.1016/0022-0000(79)90043-6
published in: Journal of Computer and System Sciences
publication date: 1979-01-01T00:00:00Z
full work available at URL: http://hdl.handle.net/1802/13806
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 3625362
zbMATH Keywords: Polynomial Time Reducibilities
zbMATH Keywords: Graph Isomorphism Problem
zbMATH Keywords: Isomorphisms of Finite Groups
zbMATH Keywords: Symmetric Cubic Graph Nonisomorphism
author: Gary L. Miller
MaRDI profile type: Publication
OpenAlex ID: W2017265236
cites work: Q5181394
cites work: Q4770409
cites work: Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
cites work: Q4138187
cites work: Q5586401
cites work: Automorphisms of graphs and coverings
cites work: On regular graphs, V
cites work: Parallel concepts in graph theory
cites work: On full embeddings of categories of algebras
cites work: Dividing a Graph into Triconnected Components
cites work: Q4142699
cites work: Riemann's hypothesis and tests for primality
cites work: On the nlog n isomorphism technique (A Preliminary Report)
cites work: Q5735245
cites work: Q5785712
cites work: On the Symmetry of Cubic Graphs
cites work: Q5524326
description: scientific article; zbMATH DE number 3625362