The saga of minimum spanning trees (Q458468)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The saga of minimum spanning trees
scientific article

    Statements

    title
    The saga of minimum spanning trees (English)
    0 references
    author
    Martin Mareš
    0 references
    publication date
    7 October 2014
    0 references
    zbMATH Keywords
    minimum spanning trees
    0 references
    describes a project that uses
    Find
    0 references
    Haskell
    0 references
    Quicksort
    0 references
    cites work
    Q4231478
    0 references
    Q3707420
    0 references
    Q3135082
    0 references
    Q5315023
    0 references
    Q4133134
    0 references
    Q4471360
    0 references
    Q4398780
    0 references
    Q4856179
    0 references
    Q4414308
    0 references
    Q4542546
    0 references
    Q2754134
    0 references
    Q4508365
    0 references
    Graph minor theory
    0 references
    Q3435477
    0 references
    Q2747613
    0 references
    Q2766845
    0 references
    Q5624995
    0 references
    The soft heap
    0 references
    Quicksort
    0 references
    Q4829006
    0 references
    Q4945509
    0 references
    Q4471376
    0 references
    Q4763326
    0 references
    Algorithms - ESA 2003
    0 references
    Q4023519
    0 references
    Q3149647
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    05C05
    0 references
    68Q25
    0 references
    68W05
    0 references
    68-02
    0 references
    zbMATH DE Number
    6352100
    0 references
    OpenAlex ID
    W1981755382
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q458468&oldid=35414796"
    Powered by MediaWiki