Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:BabaiAlgorithmYear |
2015
|
| gptkbp:complexity |
NP
|
| gptkbp:defines |
Given two finite graphs, determine whether they are isomorphic.
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:hasApplication |
cryptography
bioinformatics social network analysis |
| https://www.w3.org/2000/01/rdf-schema#label |
graph isomorphism problem
|
| gptkbp:importantFor |
chemistry
network analysis pattern recognition |
| gptkbp:notableFor |
gptkb:Babai's_quasi-polynomial_time_algorithm
|
| gptkbp:notKnownToBe |
P
NP-complete |
| gptkbp:openProblem |
P vs NP-complete status
|
| gptkbp:relatedTo |
gptkb:graph_automorphism_problem
gptkb:subgraph_isomorphism_problem graph isomorphism |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:László_Babai
|
| gptkbp:bfsLayer |
5
|