A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407)

From MaRDI portal
Revision as of 12:24, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear-time algorithm for paired-domination on circular-arc graphs
scientific article

    Statements

    A linear-time algorithm for paired-domination on circular-arc graphs (English)
    0 references
    0 references
    0 references
    13 July 2015
    0 references
    paired-domination problem
    0 references
    perfect matching
    0 references
    interval graph
    0 references
    circular-arc graph
    0 references

    Identifiers

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