Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318)

From MaRDI portal
Revision as of 12:41, 29 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2052680
Language Label Description Also known as
English
Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
scientific article; zbMATH DE number 2052680

    Statements

    Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 March 2004
    0 references
    Parallel algorithms
    0 references
    Analysis of algorithms
    0 references
    Steiner set
    0 references
    Steiner tree
    0 references
    Permutation graphs
    0 references

    Identifiers