Applications of dimensionality reduction and exponential sums to graph automorphism

DOI10.1016/j.tcs.2011.03.014zbMath1222.05170OpenAlexW1977610780MaRDI QIDQ551192

Vikram Sharma, Madhusudan Manjunath

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.014

zbMATH Keywords

exponential sumsinvariant subspacesdimensionality reductionLaplacian matrix of a graphgraph automorphismcongruent simplices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The Laplacian lattice of a graph under a simplicial distance function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph isomorphism and equality of simplices
• Two reductions of graph isomorphism to problems on polynomials
• On determining the congruence of point sets in \(d\) dimensions
• On the complexity of polytope isomorphism problems
• Simplices and spectra of graphs
• The Complexity of Modular Graph Automorphism
• Matrix Analysis
• Some NP-Complete Problems Similar to Graph Isomorphism
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Invariant Subspaces of Matrices with Applications
• Testing the congruence of d-dimensional point sets
• Algorithms and Data Structures
• Proofs from THE BOOK
• Algorithms in real algebraic geometry