A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667)

From MaRDI portal
Revision as of 03:36, 29 June 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
A polynomial-time algorithm for the paired-domination problem on permutation graphs
scientific article

    Statements

    A polynomial-time algorithm for the paired-domination problem on permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    algorithm
    0 references
    permutation graph
    0 references
    paired-domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references