Graph Isomorphism, Bounded Vertex Valences
Given two graphs with the degree of each vertex bounded, determine whether they are isomorphic to one another.
Parameters
- : number of vertices in the larger graph
Related Problems
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 1 of 1 algorithms
| See more | ||||
|---|---|---|---|---|
| Babai 1980 | 1980 | \exp(n^{\frac{1}{2} + O(1)}) | O(n^2) |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table