Completely separable graphs (Q908944)

From MaRDI portal
Revision as of 12:40, 10 July 2025 by CorrectionBot (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 4136000
Language Label Description Also known as
English
Completely separable graphs
scientific article; zbMATH DE number 4136000

    Statements

    title
    Completely separable graphs (English)
    0 references
    author
    Peter L. Hammer
    0 references
    Frédéric Maffray
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    Boolean functions
    0 references
    separability
    0 references
    Completely separable graphs
    0 references
    liner time algorithms
    0 references
    recognition
    0 references
    optimization problems
    0 references
    maximum weighted stable set
    0 references
    maximum eighted clique
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C99
    0 references
    05C38
    0 references
    05C35
    0 references
    94C10
    0 references
    94C15
    0 references
    zbMATH DE Number
    4136000
    0 references
    Wikidata QID
    Q127976387
    0 references
     
    Retrieved from "https://mardi.schubotz.org/w/index.php?title=Item:Q908944&oldid=42758335"
    Powered by MediaWiki