A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
On the nonuniform complexity of the graph isomorphism problem
Complexity theory
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A compendium of problems complete for symmetric logarithmic space
Computational Complexity
Moderately Exponential Bound for Graph Isomorphism
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
A Note on the Hardness of Tree Isomorphism
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
On the hardness of graph isomorphism
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Polynomial-time algorithms for permutation groups
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Parallel algorithms for permutation groups and graph isomorphism
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Completeness results for graph isomorphism
Journal of Computer and System Sciences
| Hi-index | 0.01 |
We prove that the graph isomorphism problem restricted to colored graphs with color multiplicities 2 and 3 is complete for symmetric logarithmic space SL under many-one reductions. This result improves the existing upper bounds for the problem.We also show that the graph automorphism problem for colored graphs with color classes of size 2 is equivalent to deciding whether an undirected graph has more than a single connected component and we prove that for color classes of size 3 the graph automorphism problem is contained in SL.