Sciweavers

Share
DLT
2010

Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups

11 years 9 months ago
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed form. As a consequence it follows that the word problem for the outer automorphism group of a graph group can be solved in polynomial time.
Niko Haubold, Markus Lohrey, Christian Mathissen
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2010
Where DLT
Authors Niko Haubold, Markus Lohrey, Christian Mathissen
Comments (0)
books