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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5526 LNCS, Issue , 2009, Pages 233-244

  Moser, Hannes ^a   Niedermeier, Rolf ^a   Sorge, Manuel ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; CARDINALITIES; CLIQUE RELAXATIONS; EXACT ALGORITHMS; NP-HARD; PARAMETERIZED; PRACTICAL ALGORITHMS; REAL-WORLD GRAPHS; SUBGRAPHS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPETITION; COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 68249124152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02011-7_22     Document Type: Conference Paper

References (15)

1. Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theory Comput. Syst. 41(3), 411-430 (2007)
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)
4. Chesler, E.J., et al.: Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nat. Genet. 37(3), 233-242 (2005)
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)
7. Grossman, J., Ion, P., Castro, R.D.: The Erdos number project (2007), http://www.oakland.edu/enp/ (accessed, January 2009)
8. Komusiewicz, C., Hüffner, F., Moser, H., Niedermeier, R.: Isolation concepts for enumerating dense subgraphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 140-150. Springer, Heidelberg (2007)
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
10. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
11. Nishimura, N., Ragde, P., Thilikos, D.M.: Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. Discrete Appl. Math. 152(1-3), 229-245 (2005)
12. Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1-3), 197-207 (2002)
13. Sanchis, L.A., Jagota, A.: Some experimental and theoretical results on test case generators for the maximum clique problem. INFORMS J. Comput. 8(2), 103-117 (1996)
14. Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. Journal of Mathematical Sociology 6, 139-154 (1978)
15. Wu, B., Pei, X.: A parallel algorithm for enumerating all the maximal k-plexes. In: Washio, T., Zhou, Z.-H., Huang, J.Z., Hu, X., Li, J., Xie, C., He, J., Zou, D., Li, K.-C., Freire, M.M. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4819, pp. 476-483. Springer, Heidelberg (2007)