Shortest-path problem is not harder than matrix multiplication (Q1149782)

From MaRDI portal
Revision as of 21:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Shortest-path problem is not harder than matrix multiplication
scientific article

    Statements

    title
    Shortest-path problem is not harder than matrix multiplication (English)
    0 references
    author
    Francesco Romani
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    transitive closure
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C50
    0 references
    05C38
    0 references
    05C20
    0 references
    zbMATH DE Number
    3711406
    0 references
    OpenAlex ID
    W2089633648
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1149782&oldid=31669946"
    Powered by MediaWiki