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

From MaRDI portal
Revision as of 23:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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