{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:03:03Z","timestamp":1743112983949,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319120263"},{"type":"electronic","value":"9783319120270"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12027-0_27","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T22:22:51Z","timestamp":1416003771000},"page":"331-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Algorithm to Condense Social Networks and Identify Brokers"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cavique","sequence":"first","affiliation":[]},{"given":"Nuno C.","family":"Marques","sequence":"additional","affiliation":[]},{"given":"Jorge M. A.","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,12]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Auber, D., Chiricota, Y., Jourdan, F., Melan\u00e7on, G.: Multiscale visualization of small world networks. In: Proceedings of the Ninth annual IEEE conference on Information visualization, INFOVIS 2003, Washington, DC, USA, pp. 75\u201381 (2003)","DOI":"10.1109\/INFVIS.2003.1249011"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Burt, R.S.: Structural Holes: The Social Structure of Competition. Harvard University Press (1992)","DOI":"10.4159\/9780674029095"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-04686-5_30","volume-title":"Progress in Artificial Intelligence","author":"L Cavique","year":"2009","unstructured":"Cavique, L., Mendes, A.B., Santos, J.M.A.: An Algorithm to Discover the k-Clique Cover in Networks. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (eds.) EPIA 2009. LNCS, vol. 5816, pp. 363\u2013373. Springer, Heidelberg (2009)"},{"issue":"6","key":"27_CR4","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10958-009-9613-x","volume":"161","author":"L Cavique","year":"2009","unstructured":"Cavique, L., Luz, C.J.: A heuristic for the stability number of a graph based on convex quadratic programming and tabu search. Journal of Mathematical Sciences 161(6), 944\u2013955 (2009)","journal-title":"Journal of Mathematical Sciences"},{"issue":"6","key":"27_CR5","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1057\/palgrave.jors.2600728","volume":"50","author":"L Cavique","year":"1999","unstructured":"Cavique, L., Rego, C., Themido, I.: Subgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem. Journal of Operational Research Society 50(6), 608\u2013616 (1999)","journal-title":"Journal of Operational Research Society"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Cavique, L., Rego, C., Themido, I.: A scatter search algorithm for the maximum clique problem. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Meta-Heuristics, pp. 227\u2013244. Kluwer Academic Pubs., Dordrecht (2002)","DOI":"10.1007\/978-1-4615-1507-4_11"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Computing Surveys 38(1), 1\u201369 (2006)","journal-title":"ACM Computing Surveys"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"27_CR9","unstructured":"Christakis, N., Fowler, J.: Connected: The surprising power of networks and how they shape our lives, Back Bay Books\/Little, Brown and Company. Hachette Book Group (2011)"},{"key":"27_CR10","unstructured":"DIMACS: Maximum clique, graph coloring, and satisfiability. Second DIMACS implementation challenge (1995), http:\/\/dimacs.rutgers.edu\/Challenges\/"},{"issue":"16","key":"27_CR11","doi-asserted-by":"publisher","first-page":"160202","DOI":"10.1103\/PhysRevLett.94.160202","volume":"94","author":"I Derenyi","year":"2005","unstructured":"Derenyi, I., Palla, G., Vicsek, T.: Clique Percolation in Random Networks. Physical Review Letters 94(16), 160202 (2005)","journal-title":"Physical Review Letters"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Du, N., Faloutsos, C., Wang, B., Akoglu, L.: Large human communication networks: patterns and a utility-driven generator. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 269\u2013278 (2009)","DOI":"10.1145\/1557019.1557054"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/TVCG.2013.151","volume":"19","author":"T Dwyer","year":"2013","unstructured":"Dwyer, T., Riche, N.H., Marriott, K., Mears, C.: Edge Compression Techniques for Visualization of Dense Directed Graphs. IEEE Transactions on Visualization and Computer Graphics 19, 2596\u20132605 (2013)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"issue":"12","key":"27_CR15","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"27_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"M Granovetter","year":"1973","unstructured":"Granovetter, M.: The strength of weak ties. American Journal of Sociology 78, 1360\u20131380 (1973)","journal-title":"American Journal of Sociology"},{"issue":"9","key":"27_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and Systems Sciences 9(9), 256\u2013278 (1974)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal 49, 291\u2013307 (1970)","journal-title":"Bell Systems Technical Journal"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce, R.D.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15, 159\u2013190 (1950)","journal-title":"Psychometrika"},{"key":"27_CR21","unstructured":"Nooy, W., Mrvar, A., Batagelj, V.: Exploratory Social Network Analysis with Pajek. Cambridge University Press (2005)"},{"key":"27_CR22","doi-asserted-by":"publisher","unstructured":"Royer, L., Reimann, M., Andreopoulos, B., Schroeder, M.: Unraveling Protein Networks with Power Graph Analysis, in Berg, Johannes. PLoS Computational Biology 4(7), e1000108 (2008), doi:10.1371\/journal.pcbi.1000108","DOI":"10.1371\/journal.pcbi.1000108"},{"key":"27_CR23","unstructured":"Scott, J.: Social Network Analysis: A Handbook. SAGE Publications Ltd. (2000)"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Soriano, P., Gendreau, M.: Tabu search algorithms for the maximum clique. In: Johnson, D.S., Trick, M.A. (eds.) Clique, Coloring and Satisfiability, Second Implementation Challenge DIMACS, pp. 221\u2013242. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/12"},{"key":"27_CR25","unstructured":"Tarawneh, R.M., Keller, P., Ebert, A.: A General Introduction To Graph Visualization Techniques. In: Garth, C., Middel, A., Hagen, H. (eds.) Proceedings of IRTG 1131, Visualization of Large and Unstructured Data Sets Workshop, pp. 151\u2013164 (2011)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization. In: ACM International Conference on Web Search and Data Mining (WSDM), pp. 587\u2013596 (2013)","DOI":"10.1145\/2433396.2433471"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence -- IBERAMIA 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12027-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T00:38:23Z","timestamp":1674175103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12027-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319120263","9783319120270"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12027-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}