An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774)

From MaRDI portal
Revision as of 03:48, 16 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7509108
Language Label Description Also known as
English
An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs
scientific article; zbMATH DE number 7509108

    Statements

    An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2022
    0 references
    design of algorithms
    0 references
    analysis of algorithms
    0 references
    permutation graph
    0 references
    \(k\)-domination
    0 references
    caterpillar
    0 references

    Identifiers