The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On hypergraph and graph isomorphism with bounded color classes
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
The Graph Isomorphism Problem and approximate categories
Journal of Symbolic Computation
| Hi-index | 0.00 |
We develop parallel techniques for dealing with permutation group problems. These are most effective on the class of groups with bounded non-abelian composition factors. For this class, we place in NC problems such as membership testing, finding the center and composition factors, and, of particular significance, finding pointwise-set-stabilisers. The last has applications to instances of graph-isomorphism and we show that NC contains isomorphism-testing for vertex-colored graphs with bounded color multiplicity, a problem not long known to be in polynomial time.