{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:15:48Z","timestamp":1729649748635,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1109\/comswa.2008.4554383","type":"proceedings-article","created":{"date-parts":[[2008,7,3]],"date-time":"2008-07-03T15:19:59Z","timestamp":1215098399000},"page":"82-89","source":"Crossref","is-referenced-by-count":7,"title":["Extracting dense communities from telecom call graphs"],"prefix":"10.1109","author":[{"given":"Vinayaka","family":"Pandit","sequence":"first","affiliation":[]},{"given":"Natwar","family":"Modani","sequence":"additional","affiliation":[]},{"given":"Sougata","family":"Mukherjea","sequence":"additional","affiliation":[]},{"given":"Amit A.","family":"Nanavati","sequence":"additional","affiliation":[]},{"given":"Sambuddha","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Agarwal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Invisible colleges: Diffusion of knowledge in scientific communities","year":"1972","author":"crane","key":"ref10"},{"year":"0","key":"ref11","article-title":"DBLP - Computer Science Bibliography"},{"key":"ref12","first-page":"718","article-title":"Structural and algorithmic aspects of massive social networks","author":"eubank","year":"2004","journal-title":"Symposium on Discrete Algorithms (SODA)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/2.989932"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/35022643"},{"key":"ref15","first-page":"163","article-title":"The small –world phenomenon: An algorithmic perspective","year":"2000","journal-title":"Proc 32nd Annual ACM Symp Theor Comp"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"year":"0","key":"ref17","article-title":"Linkedin: Relations Matter"},{"key":"ref18","first-page":"60","article-title":"The small world problem","volume":"2","author":"milgram","year":"1967","journal-title":"Psychology Today"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1086\/338954"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/1242572.1242598","article-title":"Wherefore art though R3579X? Anonymized social networks, hidden patterns, and structural steganography","author":"backstrom","year":"2007","journal-title":"Proceedings of ACM Conference on World Wide Web (WWW)"},{"key":"ref27","article-title":"Large –scale topological and dynamic properties of the internet","volume":"65","author":"vazquez","year":"2002","journal-title":"Physical Review"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)00736-7"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"ref7","first-page":"77","article-title":"Pajek: Analysis and Visualization of large networks","author":"batagelj","year":"2003","journal-title":"Graph Drawing Software"},{"key":"ref2","first-page":"598","article-title":"Massive quasi –clique detection","author":"abello","year":"2002","journal-title":"Proc Latin Am Symp Theoretical Informatics (LATIN)"},{"key":"ref9","first-page":"84","article-title":"Greedy approximation algorithms for finding dense components in a graph","author":"charikar","year":"2000","journal-title":"Proceedings of the 5th workshop on Approximation Algorithms (APPROX)"},{"key":"ref1","first-page":"332","article-title":"A functional approach to external graph algorithms","author":"abello","year":"1998","journal-title":"Proceedings of the 6th European Symosium on Algorithms (ESA)"},{"article-title":"Who shall survive?","year":"1934","author":"moreno","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016131"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183678"},{"key":"ref24","first-page":"167","article-title":"The structure and function of complex networks","year":"2003","journal-title":"SIAM Review"},{"key":"ref23","article-title":"Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality","volume":"64","year":"2001","journal-title":"Physical Review"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02478417"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1086\/230190"}],"event":{"name":"Middleware and Workshops (COMSWARE '08)","start":{"date-parts":[[2008,1,6]]},"location":"Bangalore, India","end":{"date-parts":[[2008,1,10]]}},"container-title":["2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4545865\/4554360\/04554383.pdf?arnumber=4554383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T02:25:03Z","timestamp":1709087103000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4554383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/comswa.2008.4554383","relation":{},"subject":[],"published":{"date-parts":[[2008,1]]}}}