Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes

We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most s vertices in the s-plex. Cliques are 1-plexes. In analogy to the special case of finding maximum-cardinality cliques, finding maximumcardinality s-plexes is NP-hard. Complementing previous work, we develop combinatorial, exact algorithms, which are strongly based on methods from parameterized algorithmics. The experiments with our freely available implementation indicate the competitiveness of our approach, for many real-world graphs outperforming the previously used methods.

• Type: Conference
• Year: 2009
• Where: WEA
• Authors: Hannes Moser, Rolf Niedermeier, Manuel Sorge
• Keywords: Algorithms, Cliques Called S-plexes, Maximum-cardinality Cliques, Vertex Subset, WEA 2009