ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM (Q3502844): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q314624 / rank
Normal rank
 
Property / author
 
Property / author: Pascal Weil / rank
Normal rank
 
Property / author
 
Property / author: Enric Ventura Capell / rank
 
Normal rank
Property / author
 
Property / author: Pascal Weil / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0608779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Whitehead’s algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the Whitehead Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism group of a free group: Centralizers and stabilizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stallings foldings and subgroups of free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphic orbits in free groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalent sets of elements in a free group / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:22, 28 June 2024

scientific article
Language Label Description Also known as
English
ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
scientific article

    Statements

    ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    free groups
    0 references
    automorphisms
    0 references
    Whitehead minimization problem
    0 references
    finitely generated subgroups
    0 references
    automorphic orbits
    0 references
    algorithms
    0 references
    0 references