The complexity of the proper orientation number (Q2445254)

From MaRDI portal
Revision as of 10:04, 8 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
The complexity of the proper orientation number
scientific article

    Statements

    title
    The complexity of the proper orientation number (English)
    0 references
    author
    Arash Ahadi
    0 references
    Ali Dehghan
    0 references
    publication date
    14 April 2014
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C15
    0 references
    05C10
    0 references
    zbMATH DE Number
    6284226
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    proper orientation
    0 references
    vertex coloring
    0 references
    NP-completeness
    0 references
    planar 3-SAT (type 2)
    0 references
    graph orientation
    0 references
    polynomial algorithms
    0 references
    OpenAlex ID
    W2155184843
    0 references
    arXiv ID
    1305.6432
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2445254&oldid=35383476"
    Powered by MediaWiki