Efficiently covering complex networks with cliques of similar vertices (Q2368963)

From MaRDI portal
Revision as of 16:51, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficiently covering complex networks with cliques of similar vertices
scientific article

    Statements

    Efficiently covering complex networks with cliques of similar vertices (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Random graphs
    0 references
    Intersection graphs
    0 references
    Clique cover algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references