Exact algorithms for problems related to the densest k-set problem

• Published in: Information processing letters Vol. 114; no. 9; pp. 510 - 513
• Main Authors: Chang, Maw-Shang, Chen, Li-Hsuan, Hung, Ling-Ju, Rossmanith, Peter, Wu, Guan-Han
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.09.2014; Elsevier Sequoia S.A
• Subjects: Algorithms; Cohesion; Data processing; Densest (sparsest) k-set; Design of algorithms; Exact algorithm; Graph theory; Graphs; Mathematical problems; Minimum (maximum) k-vertex cover; Partial vertex cover; Running; Set theory; Social networks; Studies; Subgroups; Vertex sets; Partial vertex cover; Minimum (maximum) k-vertex cover; Design of algorithms; Exact algorithm; Densest (sparsest) k-set

Many graph concepts such as cliques, k-clubs, and k-plexes are used to define cohesive subgroups in a social network. The concept of densest k-set is one of them. A densest k-set in an undirected graph G=(V,E) is a vertex set S⊆V of size k such that the number of edges in the subgraph of G induced b...