@article{Bron1973, 
     author = "Bron, Coen and Kerbosch, Joep", 
     doi = "10.1145/362342.362367", 
     eprint = "citation.cfm?doid=362342.362367", 
     issn = "00010782", 
     journal = "Communications of the ACM", 
     keyword = "backtracking algorithm,branch and bound technique,cliques,clusters,maximal complete subgraphs,recursion", 
     link = "http://dl.acm.org/citation.cfm?id=362342.362367 http://portal.acm.org/citation.cfm?doid=362342.362367", 
     month = "sep", 
     number = "9", 
     pages = "575--577", 
     publisher = "ACM", 
     title = "Algorithm 457: finding all cliques of an undirected graph", 
     uri = "http://dl.acm.org/citation.cfm?id=362342.362367", 
     volume = "16", 
     year = "1973", 
     zzzisbn = "0001-0782", 
}

Problems: 188