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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Connected domination and Steiner set on weighted permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation graphs: Connected domination and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank

Latest revision as of 14:13, 6 June 2024

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