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

From Wikidata

Jump to navigation Jump to search

No description defined

edit

Language	Label	Description	Also known as
English	Algorithm 457: finding all cliques of an undirected graph	No description defined

Statements

instance of

scholarly article

0 references

title

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

0 references

author name string

Coen Bron

series ordinal

1

0 references

Joep Kerbosch

series ordinal

2

0 references

language of work or name

English

0 references

publication date

1 September 1973

0 references

published in

Communications of the ACM

0 references

volume

16

0 references

issue

9

0 references

page(s)

575-577

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

Identifiers

DOI

10.1145/362342.362367

0 references

zbMATH Open document ID

0261.68018

0 references

 

Sitelinks

Wikipedia(0 entries)

edit

Wikibooks(0 entries)

edit

Wikinews(0 entries)

edit

Wikiquote(0 entries)

edit

Wikisource(0 entries)

edit

Wikiversity(0 entries)

edit

Wikivoyage(0 entries)

edit

Wiktionary(0 entries)

edit

Multilingual sites(0 entries)

edit

Retrieved from "https://www.wikidata.org/w/index.php?title=Q56210395&oldid=2059172917"