Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
chemistry
network analysis pattern recognition |
| gptkbp:complexity |
NP
GI |
| gptkbp:defines |
deciding whether two finite graphs are isomorphic
|
| gptkbp:field |
gptkb:mathematics
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Graph isomorphism
|
| gptkbp:notableFor |
gptkb:VF2_algorithm
Nauty Weisfeiler-Leman algorithm |
| gptkbp:openProblem |
unknown if in P or NP-complete
|
| gptkbp:relatedTo |
gptkb:subgraph_isomorphism_problem
graph theory isomorphism graph automorphism graph canonization |
| gptkbp:studiedBy |
Eugene Luks
|
| gptkbp:supportsAlgorithm |
gptkb:Babai's_quasi-polynomial_time_algorithm
|
| gptkbp:bfsParent |
gptkb:Isomorphism
|
| gptkbp:bfsLayer |
6
|