A Fast Algorithm for Stallings' Folding Process
arXiv:0805.2348 · doi:10.1142/S0218196706003396
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.
Cited by in corpus (6)
- Stallings graphs for quasi-convex subgroups
- A fast algorithm for Stallings foldings over virtually free groups
- The central tree property and algorithmic problems on subgroups of free groups
- Double cosets in free groups
- On the lattice of subgroups of a free group: complements and rank
- State graphs and fibered state surfaces