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 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.
Unable to display preview. Download preview PDF.
- 2.Balasundaram, B., Butenko, S., Hicks, I.V., Sachdeva, S.: Clique relaxations in social network analysis: The maximum k-plex problem (February 2008) (manuscript), http://iem.okstate.edu/baski/files/kplex4web.pdf
- 3.Batagelj, V., Mrvar, A.: Pajek datasets (2006), http://vlado.fmf.uni-lj.si/pub/networks/data/ (accessed, January 2009)
- 5.DIMACS. Maximum clique, graph coloring, and satisfiability. Second DIMACS implementation challenge (1995), http://dimacs.rutgers.edu/Challenges/ (accessed, November 2008)
- 6.Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhauser and Trotter’s local optimization theorem. In: Proc. 26th STACS, Germany, pp. 409–420. IBFI Dagstuhl, Germany (2009)Google Scholar
- 7.Grossman, J., Ion, P., Castro, R.D.: The Erdős number project (2007), http://www.oakland.edu/enp/ (accessed, January 2009)
- 9.McClosky, B., Hicks, I.V.: Combinatorial algorithms for the maximum k-plex problem (January 2009) (manuscript), http://www.caam.rice.edu/~bjm4/CombiOptPaper.pdf