Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
Chemistry
Computer science Pattern recognition |
| gptkbp:BabaiAlgorithm |
Quasipolynomial time algorithm for graph isomorphism
|
| gptkbp:category |
gptkb:Theoretical_computer_science
Combinatorics |
| gptkbp:complexity |
NP
|
| gptkbp:defines |
A bijection between the vertex sets of two graphs that preserves adjacency
|
| gptkbp:field |
gptkb:Graph_theory
|
| gptkbp:notableContributor |
gptkb:László_Babai
|
| gptkbp:openProblem |
Whether the graph isomorphism problem is in P or NP-complete
|
| gptkbp:relatedTo |
gptkb:Isomorphism
gptkb:graph Graph isomorphism problem |
| gptkbp:supportsAlgorithm |
Nauty
Weisfeiler-Leman algorithm |
| gptkbp:usedIn |
Network analysis
Database indexing Molecular structure comparison |
| gptkbp:bfsParent |
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Graph Isomorphism
|