Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275)

From MaRDI portal
Revision as of 08:15, 23 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 algorithm for (connected) bounded-degree deletion problem on unit disk graphs
scientific article

    Statements

    Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 August 2020
    0 references
    \(k\)-bounded-degree node deletion problem
    0 references
    connected \(k\)-bounded-degree node deletion problem
    0 references
    unit disk graph
    0 references
    approximation algorithm
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references