The inverse Voronoi problem in graphs. I: Hardness (Q2006948)

From MaRDI portal
Revision as of 05:32, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The inverse Voronoi problem in graphs. I: Hardness
scientific article

    Statements

    title
    The inverse Voronoi problem in graphs. I: Hardness (English)
    0 references
    author
    Édouard Bonnet
    0 references
    Sergio Cabello
    0 references
    Bojan Mohar
    0 references
    Hebert Pérez-Rosés
    0 references
    published in
    Algorithmica
    0 references
    publication date
    12 October 2020
    0 references
    zbMATH Keywords
    distances in graphs
    0 references
    Voronoi diagram
    0 references
    inverse Voronoi problem
    0 references
    NP-completeness
    0 references
    parameterized complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C12
    0 references
    68Q17
    0 references
    68Q27
    0 references
    68U05
    0 references
    zbMATH DE Number
    7259202
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2006948&oldid=26651728"
    Powered by MediaWiki