Complexity and algorithms for semipaired domination in graphs (Q5918285)

From MaRDI portal
Revision as of 22:45, 25 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7173538
Language Label Description Also known as
English
Complexity and algorithms for semipaired domination in graphs
scientific article; zbMATH DE number 7173538

    Statements

    title
    Complexity and algorithms for semipaired domination in graphs (English)
    0 references
    author
    Michael A. Henning
    0 references
    Arti Pandey
    0 references
    Vikash Tripathi
    0 references
    publication date
    11 June 2021
    0 references
    25 February 2020
    0 references
    zbMATH Keywords
    domination
    0 references
    semipaired domination
    0 references
    interval graphs
    0 references
    graph algorithm
    0 references
    NP-completeness
    0 references
    approximation algorithm
    0 references
    bipartite graphs
    0 references
    chordal graphs
    0 references
    NP-complete
    0 references

    Identifiers

    zbMATH Open document ID
    1503.68223
    0 references
    1503.68222
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C62
    0 references
    05C69
    0 references
    05C85
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    7357721
    0 references
    7173538
    0 references
    OpenAlex ID
    W3033103597
    0 references
    W2964082809
    0 references
    arXiv ID
    1904.00964
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5918285&oldid=36689004"
    Powered by MediaWiki