Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
unknown (not known to be in P or NP-complete)
|
| gptkbp:defines |
Given a graph, determine whether it has a nontrivial automorphism.
|
| gptkbp:field |
theoretical computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
graph automorphism problem
|
| gptkbp:input |
graph
|
| gptkbp:notableFor |
gptkb:Babai's_quasipolynomial_time_algorithm_(2016)
|
| gptkbp:output |
whether the graph has a nontrivial automorphism
|
| gptkbp:relatedTo |
gptkb:Weyl_group
gptkb:symmetry gptkb:graph_isomorphism_problem permutation group automorphism group of a graph |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:graph_isomorphism_problem
|
| gptkbp:bfsLayer |
6
|