Shortest distances as enumeration problem (Q6184314)

From MaRDI portal
Revision as of 20:33, 23 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 7794318
Language Label Description Also known as
English
Shortest distances as enumeration problem
scientific article; zbMATH DE number 7794318

    Statements

    title
    Shortest distances as enumeration problem (English)
    0 references
    author
    Katrin Casel
    0 references
    Tobias Friedrich
    0 references
    Stefan Neubert
    0 references
    Markus L. Schmid
    0 references
    publication date
    24 January 2024
    0 references
    zbMATH Keywords
    enumeration
    0 references
    shortest paths
    0 references
    APSP
    0 references
    fine-grained complexity
    0 references

    Identifiers

    arXiv ID
    2005.06827
    0 references
    Mathematics Subject Classification ID
    05C12
    0 references
    05C35
    0 references
    05C30
    0 references
    zbMATH DE Number
    7794318
    0 references
    OpenAlex ID
    W3024153740
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6184314&oldid=37623925"
    Powered by MediaWiki