Graph 2-isomorphism is NP-complete
From MaRDI portal
Publication:1259902
DOI10.1016/0020-0190(79)90130-3zbMath0412.68036OpenAlexW2056179367MaRDI QIDQ1259902
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)
Related Items (5)
Mathematical problems and games ⋮ Minimal decompositions of graphs into mutually isomorphic subgraphs ⋮ Compact representations of all members of an independence system ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Graph isomorphism problem
Cites Work
This page was built for publication: Graph 2-isomorphism is NP-complete
