Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396)

From MaRDI portal
Revision as of 00:17, 11 July 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
Algorithmic Aspects of Disjunctive Domination in Graphs
scientific article

    Statements

    title
    Algorithmic Aspects of Disjunctive Domination in Graphs (English)
    0 references
    author
    B. S. Panda
    0 references
    Arti Pandey
    0 references
    Subhabrata Paul
    0 references
    publication date
    29 October 2015
    0 references
    zbMATH Keywords
    domination
    0 references
    chordal graph
    0 references
    graph algorithm
    0 references
    approximation algorithm
    0 references
    NP-completeness
    0 references
    APX-completeness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C69
    0 references
    05C85
    0 references
    68Q17
    0 references
    68W25
    0 references
    90C27
    0 references
    zbMATH DE Number
    6501927
    0 references
    OpenAlex ID
    W2675930808
    0 references
    arXiv ID
    1502.07718
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3196396&oldid=36209465"
    Powered by MediaWiki