Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

By Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks. Operational Research, 2011

369 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/0238ff2cace6044d6453d6591061f6cf08960572

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Fosca Giannotti
2. Dino Pedreschi
3. Michele Coscia

In Statistical and Nonlinear Physics

1. Fosca Giannotti
2. Dino Pedreschi
3. Michele Coscia
4. Hocine Cherifi
5. Michalis Vazirgiannis
6. Fragkiskos D. Malliaros
7. Punam Bedi
8. Chhavi Sharma

Citations in the corpus

• A classification for community discovery methods in complex networks (2011, positive): “Instead, the authors use a relaxed version of a c-isolated clique called s-plex [165]: in an undirected graph G = (V,E), a vertex subset S ⊆ V of size k is called”
• A review on algorithms for maximum clique problems (2015, neutral): “Finally, there are some other interesting models related to the MCP, such as the maximum k -plex problem (Balasundaram, Butenko, & Hicks, 2011), the maximum k -club problem (Bourjolly, Laporteb, & Pesant, 2002) and the maximum/minimum edge neighborhood density clique problem (Martins, 2012).”