Graph Embedding through Random Walk for Shortest Paths Problems (Q3646123)

From MaRDI portal
Revision as of 05:24, 2 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
Graph Embedding through Random Walk for Shortest Paths Problems
scientific article

    Statements

    title
    Graph Embedding through Random Walk for Shortest Paths Problems (English)
    0 references
    author
    Yakir Berchenko
    0 references
    Mina Teicher
    0 references
    publication date
    19 November 2009
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    05C80
    0 references
    05C81
    0 references
    zbMATH DE Number
    5635947
    0 references
    zbMATH Keywords
    graph embedding
    0 references
    shortest paths problem
    0 references
    OpenAlex ID
    W2114496166
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3646123&oldid=35138909"
    Powered by MediaWiki