Graph 2-isomorphism is NP-complete
type: Item
instance of: scholarly article
title: Graph 2-isomorphism is NP-complete
zbMATH Open document ID: 0412.68036
DOI: 10.1016/0020-0190(79)90130-3
author: F. Frances Yao
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3640869
zbMATH Keywords: complexity
zbMATH Keywords: Np-complete
zbMATH Keywords: graph isomorphism
zbMATH Keywords: exact cover
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90130-3
OpenAlex ID: W2056179367
cites work: Q3872501
cites work: Q4198056
cites work: Parallel concepts in graph theory
cites work: Q4142699
description: scientific article; zbMATH DE number 3640869