Graph isomorphism testing without numerics for graphs of bounded eigenvalue multiplicity

Authors:
Martin Fürer
Affiliations:
Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA and Department of Computer Science, Priceton Unversity, Princeton, NJ
Venue:
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Year:
1995

Citing 3
Cited 2

Does co-NP have short interactive proofs?

Information Processing Letters
Graph isomorphism is in the low hierarchy

Journal of Computer and System Sciences
Isomorphism of graphs with bounded eigenvalue multiplicity

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Cyclic pattern kernels for predictive graph mining

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Computational complexity of reconstruction and isomorphism testing for designs and line graphs

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract