This is an old revision of this page, as edited by Benhiller(talk | contribs) at 19:46, 10 February 2009(←Created page with '{{stub}} The Bron-Kerbosch algorithm is a technique for finding maximal cliques in an undirected graph <ref>http://www.dfki.de/~neumann/ie-seminar/presentations/fi...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 19:46, 10 February 2009 by Benhiller(talk | contribs)(←Created page with '{{stub}} The Bron-Kerbosch algorithm is a technique for finding maximal cliques in an undirected graph <ref>http://www.dfki.de/~neumann/ie-seminar/presentations/fi...')
