Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407)

From MaRDI portal
Revision as of 09:34, 23 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
Maximizing the strong triadic closure in split graphs and proper interval graphs
scientific article

    Statements

    Maximizing the strong triadic closure in split graphs and proper interval graphs (English)
    0 references
    31 August 2020
    0 references
    strong triadic closure
    0 references
    polynomial-time algorithm
    0 references
    NP-completeness
    0 references
    split graphs
    0 references
    proper interval graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references