Cliques with maximum/minimum edge neighborhood and neighborhood density

Computers and Operations Research

Volumn 39, Issue 3, 2012, Pages 594-608

  Martins, Pedro ^a  

^a POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

Author keywords

Clique edge neighborhood; Extended and discretized formulations; Maximum clique problem

Indexed keywords

CLIQUE EDGE NEIGHBORHOOD; COMPUTATIONAL RESULTS; EDGE-BASED; EXTENDED AND DISCRETIZED FORMULATIONS; GRAPH G; MAXIMUM CLIQUE; MAXIMUM CLIQUE PROBLEMS; NODE-BASED;

EID: 79960196899     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.04.016     Document Type: Article

References (44)

1. G.D. Bader, and C.W.V. Hogue An automated method for finding molecular complexes in large protein interaction networks BMC Bioinformatics 4 2003 2
2. Batagelj V, Mrvar A. 〈 http://vlado.fmf.uni-lj.si/pub/networks/ pajek/ 〉, August 2009.
3. P. Berman, and A. Pelc Distributed fault diagnosis for multiprocessor systems Proceedings of the 20th annual symposium on fault-tolerance computing 1990 340 346
4. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo The maximum clique problem D.Z. Du, P.M. Pardalos, Handbook of combinatorial optimization (suppl. vol. A) 1999 Kluwer Dordrecht 1 74
5. D. Brélaz New methods to color the vertices of a graph Communications of the ACM 22 4 1979 251 256 (Pubitemid 9452014)
6. S. Brohée, and J. van Helden Evaluation of clustering algorithms for proteinprotein interaction networks BMC Bioinformatics 7 2006 488
7. G. Bruinsma, and W. Bernasco Criminal groups and transnational illegal markets Crime, Law & Social Change 41 2004 79 94
8. S. Butenko, and W.E. Wilhelm Clique-detection models in computational biochemistry and genomics European Journal of Operational Research 173 2006 1 17 (Pubitemid 44389583)
9. A. Caprara, R. Carr, S. Istrail, G. Lancia, and B. Walenz 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap Journal of Computational Biology 11 2004 27 52 (Pubitemid 38429362)
10. S. Corman, T. Kuhn, R. McPhee, and K. Dooney Studying complex discursive systems: centering resonance analysis of organizational communication Human Communication Research 28 2 2002 157 206 (Pubitemid 37496230)
11. D.J. Cook, and L.B. Holder Graph-based data mining IEEE Intelligent Systems 15 2 2000 32 41 (Pubitemid 30587666)
12. J.D. Davidson, B. Riley, E.N. Burright, and L.A. Duvick Identification and characterization of an ataxia-1-interacting protein: A1Up, a ubiquitin-like nuclear protein Human Molecular Genetics 9 15 2000 2305 2312
13. F. Della Croce, and R. Tadei A multi-KP modeling for the maximum-clique problem European Journal of Operational Research 73 1994 555 561
14. R.G. Downey, and M.R. Fellows Fixed parameter tractability and completeness II: completeness for W[1] Theoretical Computer Science A 141 1995 109 131
15. G.W. Flake, S. Lawrence, and C.L. Giles Efficient identification of web communities Proceedings of the sixth international conference on knowledge discovery and data mining (ACM SIGKDD-2000) 2000 ACM Press Boston, MA, USA 150 160
16. B. Gendron, A. Hertz, and P. St-Louis A sequential elimination algorithm for computing bounds on the clique number of a graph Discrete Optimization 5 3 2008 615 628
17. A. Grosso, M. Locatelli, and W. Pullan Simple ingredients leading to very efficient heuristics for the maximum clique problem Journal of Heuristics 14 6 2008 587 612
18. J.D. Han, N. Bertin, T. Hao, and D.S. Goldberg Evidence for dynamically organized modularity in the yeast proteinprotein interaction network Nature 430 2004 88 93 (Pubitemid 38915230)
19. P. Hansen, N. Mladenović, and D. Urošević Variable neighborhood search for the maximum clique Discrete Applied Mathematics 145 2004 117 125
20. X. He, H. Zha, C. Ding, and H. Simon Web document clustering using hyperlink structures Computational Statistics & Data Analysis 41 2002 19 45 (Pubitemid 35358593)
21. M. Henzinger, and S. Lawrence Extracting knowledge from the World Wide Web Proceedings of the National Academy of Sciences 101 s1 2004 5186 5191 (Pubitemid 38469125)
22. F. Hüffner, C. Komusiewicz, H. Moser, and R. Niedermeier Enumerating isolated cliques in synthetic and financial networks Lecture notes in computer science vol. 5168 2008 Springer-Verlag Berlin, Heidelberg 405 416
23. C.E. Hutchins, and M. Benham-Hutchins Hiding in plain sight: criminal network analysis Computational & Mathematical Organization Theory 16 1 2009 89 111
24. H. Ito, and K. Iwama Enumeration of isolated cliques and pseudo-cliques ACM Transactions on Algorithms 5 4 2009 Article 40
25. H. Ito, K. Iwama, and T. Osumi Linear-time enumeration of isolated cliques Lecture notes in computer science vol. 3669 2005 Springer-Verlag Berlin, Heidelberg 119 130 (Pubitemid 41491523)
26. M. Kanehisa, S. Goto, M. Hattori, and K.F. Aoki-Kinoshita From genomics to chemical genomics: new developments in KEGG Nucleic Acids Research 34 Database issue 2006 D354 D357
27. R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of computer computations 1972 Plenum Press New York 85 103
28. C. Komusiewicz, F. Hüffner, H. Moser, and R. Niedermeier Isolation concepts for efficiently enumerating dense subgraphs Theoretical Computer Science 410 2009 3640 3654
29. P. Krishna, N. Vaidya, M. Chatterjee, and D. Pradhan A cluster-based approach for routing in dynamic networks ACM SIGCOMM Computer Communication Review 1997 49 65
30. J. Lim, T. Hao, C. Shaw, and A.J. Patel A proteinprotein interaction network for Human inherited ataxias and disorders of Purkinje cell degeneration Cell 125 2006 801 814 (Pubitemid 43732348)
31. C.J. Luz, and A. Schrijver A convex quadratic characterization of the Lovász theta number SIAM Journal on Discrete Mathematics 19 2 2005 382 387 (Pubitemid 43774477)
32. P. Martins Extended and discretized formulations for the maximum clique problem Computers & Operations Research 37 2010 1348 1358
33. A. Mazurie, D. Bonchev, B. Schwikowski, and A. Buck Phylogenetic distances are encoded in networks of interacting pathways Bioinformatics 24 22 2008 2579 2585
34. A. Mazurie, D. Bonchev, B. Schwikowski, and A. Buck Evolution of metabolic networks organization BMC Systems Biology 4 2010 59 68
35. P.R.J. Östergård A fast algorithm for the maximum clique problem Discrete Applied Mathematics 120 2002 197 207
36. J.-F. Rual, K. Venkatesan, T. Hao, and T. Hirozane-Kishikawa Towards a proteome-scale map of the human proteinprotein interaction network Nature 437 2005 1173 1178 (Pubitemid 41509356)
37. D.M. Strickland, E. Barnes, and J.S. Sokol Optimal protein structure alignment using maximum cliques Operations Research 53 3 2005 389 402 (Pubitemid 41342344)
38. F. Tamanini, R. Willemsen, L. van Unen, and C. Bontekoe Differential expression of FMR1, FXR1 and FXR2 proteins in human brain and testis Human Molecular Genetics 6 8 1997 1315 1322 (Pubitemid 27351072)
39. E. Tomita, and T. Kameda An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments Journal on Global Optimization 37 2007 95 111 (Pubitemid 44876770)
40. A.X.C.N. Valente, and M.E. Cusick Yeast protein interactome topology provides framework for coordinated-functionality Nucleic Acids Research 34 9 2006 2812 2819 (Pubitemid 43985642)
41. 〈 http://www.yeastgenome.org/ 〉, accessed in June 2010.
42. 〈 http://www.ncbi.nlm.nih.gov/pubmed/ 〉, accessed in June 2010.
43. 〈 http://www.genecards.org/ 〉, accessed in June 2010.
44. 〈 http://www.uniprot.org/uniprot/ 〉, accessed in June 2010.