A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph (Q3545835): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720529.2007.10698146 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014331195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal PRAM algorithm for a spanning tree on trapezoid graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding depth-first spanning trees on trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and their coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Tree Spanners / rank
 
Normal rank

Latest revision as of 22:40, 28 June 2024

scientific article
Language Label Description Also known as
English
A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph
scientific article

    Statements

    A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph (English)
    0 references
    0 references
    11 December 2008
    0 references
    spanning tree
    0 references
    trapezoid graph
    0 references
    parallel algorithm
    0 references

    Identifiers