Login / Signup
Graph 2-Isomorphism is NP-Complete.
F. Frances Yao
Published in:
Inf. Process. Lett. (1979)
Keyphrases
</>
graph isomorphism
np complete
conp complete
computational complexity
data exchange
satisfiability problem
data complexity
np hard
graph search
conjunctive queries
graph mining
graph databases
pspace complete
decision problems
constraint satisfaction problems
phase transition
graph data
subgraph isomorphism