A Fast Algorithm for Stallings' Folding Process

Details A Fast Algorithm for Stallings' Folding Process A Fast Algorithm for Stallings' Folding Process

2008-05-15

arxiv.org/abs/0805.2348v1

Internat. J. Algebra Comput. 16 (2006), no. 6, 1031--1045

Mathematics

Group Theory

Scientific paper

We show that for a fixed free group F and an arbitrary finitely generated
subgroup H (as given above) we can perform the Stalling's folding process in
time O(N log^*(N)), where N is the sum of the word lengths of the given
generators of H.

Affiliated with

Also associated with

No associations

Rating

A Fast Algorithm for Stallings' Folding Process does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Fast Algorithm for Stallings' Folding Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Algorithm for Stallings' Folding Process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-510301