On convexity in split graphs: complexity of Steiner tree and domination (Q6123388)

From MaRDI portal
Revision as of 14:46, 27 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7812587
Language Label Description Also known as
English
On convexity in split graphs: complexity of Steiner tree and domination
scientific article; zbMATH DE number 7812587

    Statements

    title
    On convexity in split graphs: complexity of Steiner tree and domination (English)
    0 references
    author
    Arusamy Mohanapriya
    0 references
    P. Renjith
    0 references
    N. Sadagopan
    0 references
    publication date
    4 March 2024
    0 references
    zbMATH Keywords
    Steiner tree
    0 references
    domination
    0 references
    split graphs
    0 references
    tree-convex
    0 references
    circular-convex split graphs
    0 references
    parameterized complexity
    0 references

    Identifiers

    arXiv ID
    2210.02288
    0 references
    zbMATH DE Number
    7812587
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6123388&oldid=37640923"
    Powered by MediaWiki