Graph 2-isomorphism is NP-complete

DOI10.1016/0020-0190(79)90130-3MaRDI QIDQ1259902zbMATHOpenAlexFDO

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

• scientific article; zbMATH DE number 3675942 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Parallel concepts in graph theory

Cited in

(5)

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

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)