Algorithm 457: finding all cliques of an undirected graph. Bron, C. & Kerbosch, J. Communications of the ACM, 16(9):575–577, September, 1973.
Algorithm 457: finding all cliques of an undirected graph [link]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