Minimum Bisection Is NP-hard on Unit Disk Graphs (Q2922613)

From MaRDI portal
Revision as of 09:53, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum Bisection Is NP-hard on Unit Disk Graphs
scientific article

    Statements

    title
    Minimum Bisection Is NP-hard on Unit Disk Graphs (English)
    0 references
    author
    George B. Mertzios
    0 references
    Josep Diaz
    0 references
    publication date
    14 October 2014
    0 references
    zbMATH Keywords
    minimum bisection problem
    0 references
    unit disk graphs
    0 references
    planar graphs
    0 references
    NP-hardness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    05C10
    0 references
    05C62
    0 references
    zbMATH DE Number
    6355319
    0 references
    OpenAlex ID
    W2963515234
    0 references
    arXiv ID
    1404.0117
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2922613&oldid=33571014"
    Powered by MediaWiki