The densest k-subgraph problem on clique graphs

The Dense k -Subgraph Problem

Uriel Feige, David Peleg, Guy Kortsarz · Algorithmica · 2001 · 602 citations

Computing, Computer Science, Mathematics +8

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

Fǎnicǎ Gavril · SIAM Journal on Computing · 1972 · 536 citations

Natural Sciences, Computer Science, Mathematics +11

Heuristic and Special Case Algorithms for Dispersion Problems

S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi · Operations Research · 1994 · 266 citations

Natural Sciences, Decision Sciences, Mathematics +16

Clustering and domination in perfect graphs

Derek G. Corneil, Yehoshua Perl · Discrete Applied Mathematics · 1984 · 244 citations

Natural Sciences, Mathematics, Combinatorics +7

Greedily Finding a Dense Subgraph

Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki et al. · Journal of Algorithms · 2000 · 214 citations

Computing, Mining Engineering, Computational Geometry +8