An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Fang-Rong Hsu / rank
 
Normal rank
Property / author
 
Property / author: Richard Chia-Tung Lee / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / 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 Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00009-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053724095 / rank
 
Normal rank

Latest revision as of 10:56, 30 July 2024

scientific article
Language Label Description Also known as
English
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
scientific article

    Statements

    An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    parallel algorithms
    0 references
    permutation graphs
    0 references
    breadth-first search trees
    0 references

    Identifiers