On Graph Isomorphism for Restricted Graph Classes-Reference-Cited by-同舟云学术

On Graph Isomorphism for Restricted Graph Classes

Published:2006 Issue: Volume: Page:241-256
ISSN:0302-9743
Container-title:Logical Approaches to Computational Barriers
language:
Short-container-title:

Author:

Köbler Johannes

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11780342_26

Reference49 articles.

1. Lecture Notes in Computer Science;M. Agrawal,2005

2. Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theoretical Computer Science 107(1), 3–30 (1993)

3. Lecture Notes in Computer Science;V. Arvind,2006

4. Arvind, V., Kurur, P., Vijayaraghavan, T.: Bounded color multiplicity graph isomorphism is in the #L hierarchy. In: Proc. 20th Annual IEEE Conference on Computational Complexity, pp. 13–27. IEEE Computer Society Press, Los Alamitos (2005)

5. Arvind, V., Torán, J.: Isomorphism testing: Pespective and open problems. Bulletin of the European Association of Theoretical Computer Science (BEATCS) 86 (2005)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space;2021 IEEE 37th International Conference on Data Engineering (ICDE);2021-04

2. A spectral assignment approach for the graph isomorphism problem;Information and Inference: A Journal of the IMA;2018-02-09

3. Colored Hypergraph Isomorphism is Fixed Parameter Tractable;Algorithmica;2013-04-30

4. Potential Applications;Physical Implementation of Quantum Walks;2013-04-04

5. An enhanced classical approach to graph isomorphism using continuous-time quantum walk;Journal of Physics A: Mathematical and Theoretical;2012-01-04