Graph 2-isomorphism is NP-complete

DOI10.1016/0020-0190(79)90130-3zbMATH Open0412.68036OpenAlexW2056179367MaRDI QIDQ1259902FDOQ1259902

Authors: F. Frances Yao 

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90130-3

zbMATH Keywords

complexitygraph isomorphismexact coverNp-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel concepts in graph theory
• Title not available (Why is that?)

Cited In (5)

• Graph theory (algorithmic, algebraic, and metric problems)
• Mathematical problems and games
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• Compact representations of all members of an independence system
• Graph isomorphism problem

This page was built for publication: Graph 2-isomorphism is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259902)