On the minimum path problem in Knödel graphs (Q3593374)

From MaRDI portal
Revision as of 23:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the minimum path problem in Knödel graphs
scientific article

    Statements

    title
    On the minimum path problem in Knödel graphs (English)
    0 references
    published in
    Networks
    0 references
    publication date
    20 July 2007
    0 references
    zbMATH Keywords
    interconnection network
    0 references
    Knödel graph
    0 references
    shortest path
    0 references
    approximation algorithm
    0 references

    Identifiers

    DOI
    10.1002/net.20169
    0 references
    Mathematics Subject Classification ID
    05C38
    0 references
    05C85
    0 references
    68M10
    0 references
    90B18
    0 references
    11A63
    0 references
    11K16
    0 references
    68R10
    0 references
    90C35
    0 references
    zbMATH DE Number
    5173300
    0 references
    OpenAlex ID
    W4230596415
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3593374&oldid=32279625"
    Powered by MediaWiki