Applications of dimensionality reduction and exponential sums to graph automorphism
From MaRDI portal
Publication:551192
DOI10.1016/J.TCS.2011.03.014zbMATH Open1222.05170OpenAlexW1977610780MaRDI QIDQ551192FDOQ551192
Authors: Madhusudan Manjunath, Vikram Sharma
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
Recommendations
dimensionality reductionexponential sumsinvariant subspacesLaplacian matrix of a graphgraph automorphismcongruent simplices
Cites Work
- Matrix Analysis
- An elementary proof of a theorem of Johnson and Lindenstrauss
- On the complexity of polytope isomorphism problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- On determining the congruence of point sets in \(d\) dimensions
- Proofs from THE BOOK
- Some NP-Complete Problems Similar to Graph Isomorphism
- Title not available (Why is that?)
- Invariant Subspaces of Matrices with Applications
- Simplices and spectra of graphs
- Algorithms and Data Structures
- Graph isomorphism and equality of simplices
- Two reductions of graph isomorphism to problems on polynomials
- The complexity of modular graph automorphism
- Title not available (Why is that?)
- Testing the congruence of d-dimensional point sets
Cited In (1)
This page was built for publication: Applications of dimensionality reduction and exponential sums to graph automorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551192)