Priority algorithms for graph optimization problems (Q1041242)

From MaRDI portal
Revision as of 06:26, 2 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
Priority algorithms for graph optimization problems
scientific article

    Statements

    title
    Priority algorithms for graph optimization problems (English)
    0 references
    author
    Allan Borodin
    0 references
    Kim S. Larsen
    0 references
    Nazanin Mirmohammadi
    0 references
    Joan. Boyar
    0 references
    publication date
    1 December 2009
    0 references
    zbMATH DE Number
    5641363
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    greedy algorithms
    0 references
    vertex cover
    0 references
    independent set
    0 references
    vertex coloring
    0 references
    OpenAlex ID
    W2136026170
    0 references
    cites work
    Q4411275
    0 references
    Q3002764
    0 references
    Q2766829
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1041242&oldid=35140892"
    Powered by MediaWiki