Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms in Graph Theory: Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The VLSI Complexity of Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient parallel strong orientation / rank
 
Normal rank

Latest revision as of 12:38, 18 June 2024

scientific article
Language Label Description Also known as
English
Parallel ear decomposition search (EDS) and st-numbering in graphs
scientific article

    Statements

    Parallel ear decomposition search (EDS) and st-numbering in graphs (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    st-numbering
    0 references
    undirected graphs
    0 references
    ear decomposition search
    0 references
    parallel algorithm
    0 references

    Identifiers