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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:30, 7 March 2024

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