Isolation concepts for efficiently enumerating dense subgraphs

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3640-3654

  Komusiewicz, Christian ^a   Hüffner, Falk ^a   Moser, Hannes ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Clique; Exact algorithm; Fixed parameter tractability; NP hard problem; Parameterized complexity; s plex

Indexed keywords

CLIQUE; EXACT ALGORITHM; FIXED-PARAMETER TRACTABILITY; NP-HARD PROBLEM; PARAMETERIZED COMPLEXITY; S-PLEX;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PARAMETER ESTIMATION;

MATHEMATICAL OPERATORS;

EID: 68249084724     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.04.021     Document Type: Article

References (26)

1. B. Balasundaram, S. Butenko, I.V. Hicks, S. Sachdeva, Clique relaxations in social network analysis: The maximum k-plex problem, Operations Research (2009) (in press)
2. Balasundaram B., Butenko S., and Trukhanovzu S. Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization 10 1 (2005) 23-39
3. Butenko S., and Wilhelm W.E. Clique-detection models in computational biochemistry and genomics. European Journal of Operational Research 173 1 (2006) 1-17
4. Chesler E.J., Lu L., Shou S., Qu Y., Gu J., Wang J., Hsu H.C., Mountz J.D., Baldwin N.E., Langston M.A., Threadgill D.W., Manly K.F., and Williams R.W. Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nature Genetics 37 3 (2005) 233-242
5. Damaschke P. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science 351 3 (2006) 337-350
6. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
7. Fellows M.R., Guo J., Moser H., and Niedermeier R. A generalization of Nemhauser and Trotter's local optimization theorem. Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. STACS'09, Dagstuhl Seminar Proceedings, pages 409-420. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI) (2009), Schloss Dagstuhl, Germany
8. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
9. 0.288 n) independent set algorithm. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA'06 (2006), ACM Press 18-25
10. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman
11. 1 - ε{lunate}. Acta Mathematica 182 1 (1999) 105-142
12. Hüffner F., Komusiewicz C., Moser H., and Niedermeier R. Enumerating isolated cliques in synthetic and financial networks. Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications. COCOA'08. LNCS vol. 5165 (2008), Springer 405-416
13. Hüffner F., Niedermeier R., and Wernicke S. Fixed-parameter algorithms for graph-modeled data clustering. In: Butenko S., Chaovalitwongse W.A., and Pardalos P.M. (Eds). Clustering Challenges in Biological Networks (2009), World Scientific
14. H. Ito, K. Iwama, Enumeration of isolated cliques and pseudo-cliques, ACM Transactions on Algorithms (2008) (in press)
15. Ito H., Iwama K., and Osumi T. Linear-time enumeration of isolated cliques. Proceedings of the 13th European Symposium on Algorithms. ESA '05. LNCS vol. 3669 (2005), Springer 119-130
16. C. Komusiewicz, Various isolation concepts for the enumeration of dense subgraphs, Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany, 2007
17. Komusiewicz C., Hüffner F., Moser H., and Niedermeier R. Isolation concepts for enumerating dense subgraphs. Proceedings of the 13th International Computing and Combinatorics Conference. COCOON'07. LNCS vol. 4598 (2007), Springer 140-150
18. Kosub S. Local density. In: Brandes U., and Erlebach T. (Eds). Network Analysis: Methodological Foundations. LNCS vol. 3418 (2005), Springer 112-142 (Chapter 6)
19. Lewis J.M., and Yannakakis M. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences 20 2 (1980) 219-230
20. Moser H., Niedermeier R., and Sorge M. Algorithms and experiments for clique relaxations-finding maximum s-plexe. Proceedings of the 8th International Symposium on Experimental Algorithms. SEA'09. LNCS vol. 5526 (2009), Springer 233-244
21. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
22. Nishimura N., Ragde P., and Thilikos D.M. Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discrete Applied Mathematics 152 1-3 (2005) 229-245
23. Palla G., Derényi I., Farkas I., and Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society. Nature 435 7043 (2005) 814-818
24. Robson J.M. Algorithms for maximum independent sets. Journal of Algorithms 7 3 (1986) 425-440
25. Seidman S.B., and Foster B.L. A graph-theoretic generalization of the clique concept. Journal of Mathematical Sociology 6 1 (1978) 139-154
26. Tomita E., Tanaka A., and Takahashi H. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science 363 1 (2006) 28-42