Graph isomorphism testing without numerics for graphs of bounded eigenvalue multiplicity

Keyphrases

• Graph Isomorphism 100%
• Numerics 100%
• Isomorphism Class 100%
• Polynomial Time 66%
• Graph Isomorphism Problem 66%
• Unified Algorithm 66%
• Eigenvalues 33%
• Combinatorics 33%
• Isomorphism 33%
• Numerical Approximation 33%
• All-natural 33%
• Equal Length 33%
• Direct Way 33%
• Linear Algebra 33%
• Polynomially Solvable 33%
• Alien 33%
• Group Theory 33%
• Combinatorial Approach 33%
• Distinct Parts 33%
• Classical Polynomials 33%
• Eigenspace 33%
• Basis Vectors 33%
• Time-varying Graphs 33%
• Mathematical Problems 33%
• Discrete Method 33%

Mathematics

• Eigenvalue 100%
• Numerics 100%
• Polynomial Time 50%
• Combinatorics 25%
• Numerical Approximation 25%
• Linear Algebra 25%
• Eigenspace 25%
• Equal Length 25%
• Basis Vector 25%