Computing Geometric Minimum-Dilation Graphs Is NP-Hard (Q3595495)

From MaRDI portal
Revision as of 21:16, 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
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
scientific article

    Statements

    title
    Computing Geometric Minimum-Dilation Graphs Is NP-Hard (English)
    0 references
    author
    Rolf Klein
    0 references
    Martin Kuetz
    0 references
    publication date
    28 August 2007
    0 references
    Mathematics Subject Classification ID
    05C10
    0 references
    05C12
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5183464
    0 references
    zbMATH Keywords
    dilation
    0 references
    geometric network
    0 references
    plane graph
    0 references
    spanning ratio
    0 references
    stretch factor
    0 references
    NP-hardness
    0 references
    OpenAlex ID
    W1744317798
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3595495&oldid=31719150"
    Powered by MediaWiki