A simpler minimum spanning tree verification algorithm (Q1355729): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q290235
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Valerie King / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear verification for spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Path Compression on Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02526037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089290774 / rank
 
Normal rank

Latest revision as of 11:20, 30 July 2024

scientific article
Language Label Description Also known as
English
A simpler minimum spanning tree verification algorithm
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references