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

From MaRDI portal
Created claim: Wikidata QID (P12): Q56210395, #quickstatements; #temporary_batch_1704602819833
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:48, 5 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