Algorithms and experiments for clique relaxations-finding maximum s-plexes

Hannes Moser, Rolf Niedermeier, Manuel Sorge

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations


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 maximum-cardinality 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.

Original languageEnglish
Title of host publicationExperimental Algorithms - 8th International Symposium, SEA 2009, Proceedings
Number of pages12
StatePublished - 20 Aug 2009
Externally publishedYes
Event8th International Symposium on Experimental Algorithms, SEA 2009 - Dortmund, Germany
Duration: 4 Jun 20096 Jun 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5526 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference8th International Symposium on Experimental Algorithms, SEA 2009

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Algorithms and experiments for clique relaxations-finding maximum s-plexes'. Together they form a unique fingerprint.

Cite this