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

From MaRDI portal
Revision as of 07:01, 7 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56210395, #quickstatements; #temporary_batch_1704602819833)
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
    0 references