Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884)

From MaRDI portal
Revision as of 10:54, 4 July 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
Linear-time algorithm for the paired-domination problem in convex bipartite graphs
scientific article

    Statements

    Linear-time algorithm for the paired-domination problem in convex bipartite graphs (English)
    0 references
    0 references
    6 December 2012
    0 references
    graph algorithms
    0 references
    linear-time algorithms
    0 references
    paired-domination
    0 references
    total domination
    0 references
    convex bipartite graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references