Algorithm 457: finding all cliques of an undirected graph. Bron, C. & Kerbosch, J. Communications of the ACM, 16(9):575–577, September, 1973.
Paper doi bibtex @article{Bron1973,
title = {Algorithm 457: finding all cliques of an undirected graph},
volume = {16},
issn = {00010782},
url = {http://portal.acm.org/citation.cfm?doid=362342.362367},
doi = {10.1145/362342.362367},
number = {9},
journal = {Communications of the ACM},
author = {Bron, Coen and Kerbosch, Joep},
month = sep,
year = {1973},
pages = {575--577},
}
Downloads: 0
{"_id":"qtZptwpv65DAg5hbA","authorIDs":[],"author_short":["Bron, C.","Kerbosch, J."],"bibbaseid":"bron-kerbosch-algorithm457findingallcliquesofanundirectedgraph-1973","bibdata":{"bibtype":"article","type":"article","title":"Algorithm 457: finding all cliques of an undirected graph","volume":"16","issn":"00010782","url":"http://portal.acm.org/citation.cfm?doid=362342.362367","doi":"10.1145/362342.362367","number":"9","journal":"Communications of the ACM","author":[{"propositions":[],"lastnames":["Bron"],"firstnames":["Coen"],"suffixes":[]},{"propositions":[],"lastnames":["Kerbosch"],"firstnames":["Joep"],"suffixes":[]}],"month":"September","year":"1973","pages":"575–577","bibtex":"@article{Bron1973,\n\ttitle = {Algorithm 457: finding all cliques of an undirected graph},\n\tvolume = {16},\n\tissn = {00010782},\n\turl = {http://portal.acm.org/citation.cfm?doid=362342.362367},\n\tdoi = {10.1145/362342.362367},\n\tnumber = {9},\n\tjournal = {Communications of the ACM},\n\tauthor = {Bron, Coen and Kerbosch, Joep},\n\tmonth = sep,\n\tyear = {1973},\n\tpages = {575--577},\n}\n\n","author_short":["Bron, C.","Kerbosch, J."],"key":"Bron1973","id":"Bron1973","bibbaseid":"bron-kerbosch-algorithm457findingallcliquesofanundirectedgraph-1973","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?doid=362342.362367"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/girdhar","creationDate":"2015-04-23T04:51:45.061Z","downloads":0,"keywords":[],"search_terms":["algorithm","457","finding","cliques","undirected","graph","bron","kerbosch"],"title":"Algorithm 457: finding all cliques of an undirected graph","year":1973,"dataSources":["tEGSZgiRhfioQCE7H","XFrKPG99s5t3W7xuW"]}