Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629)

From MaRDI portal
Revision as of 06:32, 3 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
Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
scientific article

    Statements

    Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (English)
    0 references
    4 October 2010
    0 references
    independent set
    0 references
    graph coloring
    0 references
    co-\(k\)-plex
    0 references
    \(k\)-dependent set
    0 references
    defective coloring
    0 references
    \(t\)-improper coloring
    0 references

    Identifiers