Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

References

• Abello J., Pardalos P. M., Resende M. G. C., Abello J., Vitter J. On maximum clique problems in very large graphs. External Memory Algorithms and Visualization (1999) 50(American Mathematical Society, Providence, RI) 119–130DIMACS Series on Discrete Mathematics and Theoretical Computer SciencesCrossref, Google Scholar
• Abello J., Resende M. G. C., Sudarsky S., Rajsbaum S. Massive quasi-clique detection. LATIN 2002: Theoretical Informatics (2002) (Springer-Verlag, London) 598–612Crossref, Google Scholar
• Alba R. D. A graph-theoretic definition of a sociometric clique. J. Math. Sociol. (1973) 3(1):113–126Crossref, Google Scholar
• Albert R., Jeong H., Barabási A.-L. Error and attack tolerance of complex networks. Nature (2000) 406(6794):378–382Crossref, Google Scholar
• Alderson D. L. Catching the “network science” bug: Insight and opportunity for the operations researcher. Oper. Res. (2008) 56(5):1047–1065Link, Google Scholar
• Almaas E., Barabási A.-L., Koonin E., Wolf Y. I., Karev G. P. Power laws in biological networks. Power Laws, Scale-Free Networks and Genome Biology (2006) (Springer Science + Business Media, New York) 1–11Crossref, Google Scholar
• Balasundaram B. Graph theoretic generalizations of clique: Optimization and extensions. (2007) . Ph.D. thesis, Texas A&M University, College StationGoogle Scholar
• Barabási A.-L., Albert R. Emergence of scaling in random networks. Science (1999) 286(5439):509–512Crossref, Google Scholar
• Barabási A.-L., Albert R., Jeong H. Scale-free characteristics of random networks: The topology of the World Wide Web. Physica A (2000a) 281(1–4):69–77Crossref, Google Scholar
• Barabási A.-L., Albert R., Jeong H., Bianconi G. Power-law distribution of the World Wide Web. Science (2000b) 287(5461):2115aCrossref, Google Scholar
• Batagelj V., Mrvar A. Pajek data sets: Reuters terror news network. (2006) . Accessed March 2008, http://vlado.fmf.uni-lj.si/pub/networks/data/CRA/terror.htmGoogle Scholar
• Boginski V., Butenko S., Pardalos P. Mining market data: A network approach. Comput. Oper. Res. (2006) 33(11):3171–3184Crossref, Google Scholar
• Bomze I. M., Budinich M., Pardalos P. M., Pelillo M., Du D.-Z., Pardalos P. M. The maximum clique problem. Handbook of Combinatorial Optimization (1999) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 1–74Crossref, Google Scholar
• Broido A., Claffy K. C., Fahmy S., Park K. Internet topology: Connectivity of IP graphs. Scalability and Traffic Control IP Networks (2001) (SPIE Publications, Bellingham, WA) 172–187Crossref, Google Scholar
• Carraghan R., Pardalos P. An exact algorithm for the maximum clique problem. Oper. Res. Lett. (1990) 9(6):375–382Crossref, Google Scholar
• Chung F., Lu L.Complex Graphs and Networks (2006) (American Mathematical Society, Providence, RI) CBMS Lecture SeriesCrossref, Google Scholar
• Cook D. J., Holder L. B. Graph-based data mining. IEEE Intelligent Systems (2000) 15(2):32–41Crossref, Google Scholar
• Corman S., Dooley K., McPhee R. LOCKS: Analysis of media coverage of the terrorist attacks. (2006) . Accessed June 2006, http://locks.asu.edu/terror/Google Scholar
• Corman S., Kuhn T., McPhee R., Dooley K. Studying complex discursive systems: Centering resonance analysis of organizational communication. Human Comm. Res. (2002) 28(2):157–206Crossref, Google Scholar
• Corneil D., Perl Y. Clustering and domination in perfect graphs. Discrete Appl. Math. (1984) 9(1):27–39Crossref, Google Scholar
• DIMACS Cliques, coloring, and satisfiability: Second DIMACS implementation challenge. (1995) . Accessed March 2007, http://dimacs.rutgers.edu/Challenges/Google Scholar
• Fischer I., Meinl T., Thissen W., Wieringa P., Pantic M., Ludema M. Graph based molecular data mining—An overview. Proc. 2004 IEEE Internat. Conf. Systems, Man and Cybernetics (2004) (IEEE, Piscataway, NJ) 4578–4582Crossref, Google Scholar
• Freeman L. C. The sociological concept of “group”: An empirical test of two models. Amer. J. Sociol. (1992) 98(1):152–166Crossref, Google Scholar
• Grossman J., Ion P., De Castro R. The Erdös number project. (1995) . Accessed March 2007, http://www.oakland.edu/enp/Google Scholar
• Harary F.Graph Theory (1988) (Narosa Publishing House, New Delhi, India) Google Scholar
• Harary F., Ross I. C. A procedure for clique detection using the group matrix. Sociometry (1957) 20:205–215Crossref, Google Scholar
• Hasselberg J., Pardalos P. M., Vairaktarakis G. Test case generators and computational results for the maximum clique problem. J. Global Optim. (1993) 3(4):463–482Crossref, Google Scholar
• ILOG ILOG CPLEX. (1987–2009) . Accessed May 2009, http://www.ilog.com/products/cplex/Google Scholar
• Ito T., Chiba T., Ozawa R., Yoshida M., Hattori M., Sakaki Y. A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proc. Natl. Acad. Sci. USA (2001) 98(8):4569–4574Crossref, Google Scholar
• Johnson D. S., Trick M. A. Cliques, coloring, and satisfiability: Second DIMACS implementation challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1996) 26(American Mathematical Society, Providence, RI) Google Scholar
• Luce R. D. Connectivity and generalized cliques in sociometric group structure. Psychometrika (1950) 15(2):169–190Crossref, Google Scholar
• Luce R. D., Perry A. D. A method of matrix analysis of group structure. Psychometrika (1949) 14(2):95–116Crossref, Google Scholar
• Mokken R. J. Cliques, clubs and clans. Quality and Quantity (1979) 13(2):161–173Crossref, Google Scholar
• Nagurney A.Innovation in Financial and Economic Networks (2003) (Edward Elgar Publishers, London) Google Scholar
• Östergård P. R. J. A fast algorithm for the maximum clique problem. Discrete Appl. Math. (2002) 120(1–3):197–207Crossref, Google Scholar
• Padberg M. W. On the facial structure of set packing polyhedra. Math. Programming (1973) 5(1):199–215Crossref, Google Scholar
• Peng X., Langston M. A., Saxton A. M., Baldwin N. E., Snoddy J. R., McConnell P., Lin S. M., Hurban P. Detecting network motifs in gene co-expression networks through integration of protein domain information. Methods of Microarray Data Analysis V (2007) (Springer, New York) 89–102Crossref, Google Scholar
• Ravi S. S., Rosenkrantz D. J., Tayi G. K. Heuristics and special case algorithms for dispersion problems. Oper. Res. (1994) 42(2):299–310Link, Google Scholar
• Sanchis L. A., Jagota A. Some experimental and theoretical results on test case generators for the maximum clique problem. INFORMS J. Comput. (1996) 8(2):103–117Link, Google Scholar
• Scott J.Social Network Analysis: A Handbook (2000) 2nd ed.(Sage Publications, London) Google Scholar
• Seidman S. B. Network structure and minimum degree. Soc. Networks (1983) 5(3):269–287Crossref, Google Scholar
• Seidman S. B., Foster B. L. A graph theoretic generalization of the clique concept. J. Math. Sociol. (1978) 6(1):139–154Crossref, Google Scholar
• Spirin V., Mirny L. A. Protein complexes and functional modules in molecular networks. Proc. Natl, Acad. Sci. USA (2003) 100(21):12123–12128Crossref, Google Scholar
• Trotter L. E. A class of facet producing graphs for vertex packing polyhedra. Discrete Math. (1975) 12(4):373–388Crossref, Google Scholar
• Washio T., Motoda H. State of the art of graph-based data mining. SIGKDD Explor. Newsletter (2003) 5(1):59–68Crossref, Google Scholar
• Wasserman S., Faust K.Social Network Analysis (1994) (Cambridge University Press, New York) Crossref, Google Scholar