MAX-plus objects to study the complexity of graphs (Q479164)

From MaRDI portal
Revision as of 10:29, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
MAX-plus objects to study the complexity of graphs
scientific article

    Statements

    title
    MAX-plus objects to study the complexity of graphs (English)
    0 references
    author
    Cristiano Bocci
    0 references
    Luca Chiantini
    0 references
    Fabio Rapallo
    0 references
    publication date
    5 December 2014
    0 references
    zbMATH Keywords
    matchings
    0 references
    combinatorial central limit theorem
    0 references
    random permutations
    0 references
    complement graph
    0 references
    describes a project that uses
    R
    0 references
    Maple
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C42
    0 references
    05C35
    0 references
    05C80
    0 references
    60F05
    0 references
    05C90
    0 references
    zbMATH DE Number
    6377126
    0 references
    OpenAlex ID
    W2022875037
    0 references
    arXiv ID
    1111.1352
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q479164&oldid=35427068"
    Powered by MediaWiki