Fast algorithms for the dominating set problem on permutation graphs (Q2366239)

From MaRDI portal
Revision as of 07:52, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Fast algorithms for the dominating set problem on permutation graphs
scientific article

    Statements

    title
    Fast algorithms for the dominating set problem on permutation graphs (English)
    0 references
    author
    Yanyan Li
    0 references
    published in
    Algorithmica
    0 references
    publication date
    29 June 1993
    0 references
    zbMATH Keywords
    dominating set problem
    0 references
    permutation graphs
    0 references
    dynamic programming
    0 references
    data structures
    0 references

    Identifiers

    DOI
    10.1007/BF01190158
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    90C39
    0 references
    90C35
    0 references
    68P10
    0 references
    zbMATH DE Number
    223480
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2366239&oldid=26907582"
    Powered by MediaWiki