A Fast Algorithm for Stallings' Folding Process
Group Theory
2014-03-27 v1
Abstract
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.
Cite
@article{arxiv.0805.2348,
title = {A Fast Algorithm for Stallings' Folding Process},
author = {Nicholas Wembley Matheson Touikan},
journal= {arXiv preprint arXiv:0805.2348},
year = {2014}
}