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

From MaRDI portal
Revision as of 01:04, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    Algorithm 457: finding all cliques of an undirected graph (English)
    0 references
    author
    Coen Bron
    0 references
    Joep Kerbosch
    0 references
    publication date
    1973
    0 references

    Identifiers

    DOI
    10.1145/362342.362367
    0 references
    zbMATH DE Number
    3412166
    0 references
    Wikidata QID
    Q56210395
    0 references
    OpenAlex ID
    W2116007667
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5677064&oldid=32514153"
    Powered by MediaWiki