An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees (Q5851104)

From MaRDI portal
Revision as of 21:32, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5661057
Language Label Description Also known as
English
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
scientific article; zbMATH DE number 5661057

    Statements

    title
    An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees (English)
    0 references
    author
    Torben Hagerup
    0 references
    publication date
    21 January 2010
    0 references

    Identifiers

    zbMATH DE Number
    5661057
    0 references
    OpenAlex ID
    W1491195793
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5851104&oldid=31776823"
    Powered by MediaWiki