Algorithm 457: finding all cliques of an undirected graph (Q5677064)

From MaRDI portal
Revision as of 21:44, 30 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3412166
Language Label Description Also known as
English
Algorithm 457: finding all cliques of an undirected graph
scientific article; zbMATH DE number 3412166

    Statements

    Algorithm 457: finding all cliques of an undirected graph (English)
    0 references
    0 references
    0 references
    0 references
    1973
    0 references
    0 references