Sciweavers

WEA
2009
Springer
123views Algorithms» more  WEA 2009»
14 years 6 months ago
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...
Hannes Moser, Rolf Niedermeier, Manuel Sorge