Methods of finding all minimum coverings of a graph by cliques (Q1903945)

From MaRDI portal
Revision as of 06:11, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Methods of finding all minimum coverings of a graph by cliques
scientific article

    Statements

    title
    Methods of finding all minimum coverings of a graph by cliques (English)
    0 references
    author
    E. V. Brattseva
    0 references
    V. P. Cherenin
    0 references
    publication date
    7 March 1996
    0 references
    zbMATH Keywords
    bichromatic graph algorithm
    0 references
    scanning methods
    0 references

    Identifiers

    zbMATH DE Number
    825961
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1903945&oldid=26585711"
    Powered by MediaWiki