An optimal parallel algorithm forc-vertex-ranking of trees (Q834935): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2004.07.007 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2004.07.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044146506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for generalized vertex-rankings of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex ranking of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph partition problem with application to VLSI layout / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2004.07.007 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:27, 9 December 2024

scientific article
Language Label Description Also known as
English
An optimal parallel algorithm forc-vertex-ranking of trees
scientific article

    Statements

    An optimal parallel algorithm forc-vertex-ranking of trees (English)
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    ordered coloring
    0 references
    parallel algorithms
    0 references
    separator-tree
    0 references
    tree contraction
    0 references
    vertex-ranking
    0 references

    Identifiers