An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563)

From MaRDI portal
Revision as of 03:43, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
scientific article

    Statements

    title
    An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (English)
    0 references
    author
    E. Lappas
    0 references
    Leonidas Palios
    0 references
    publication date
    11 December 2009
    0 references
    zbMATH Keywords
    permutation graphs
    0 references
    paired-domination
    0 references
    domination
    0 references
    algorithms
    0 references
    complexity
    0 references

    Identifiers

    zbMATH DE Number
    5645265
    0 references
    OpenAlex ID
    W2160788672
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3651563&oldid=33057873"
    Powered by MediaWiki