BronKerbosch algorithm

#	Item
1	Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-06-25 05:19:55 Graph theory NP-complete problems Graph operations Clique Degeneracy Tree Degree Vertex Neighbourhood Clique problem BronKerbosch algorithm
2	Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees Charalampos E. Tsourakakis1 Francesco Bonchi2 Aristides Gionis3 2 Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-06-09 08:58:15 Graph theory NP-complete problems Dense subgraph Clique BronKerbosch algorithm Cograph Modular product of graphs