{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T18:40:12Z","timestamp":1738262412590,"version":"3.35.0"},"reference-count":37,"publisher":"Elsevier BV","issue":"15","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1016\/j.comnet.2008.06.005","type":"journal-article","created":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T09:18:54Z","timestamp":1213435134000},"page":"2831-2841","source":"Crossref","is-referenced-by-count":5,"title":["Finding a dense-core in Jellyfish graphs"],"prefix":"10.1016","volume":"52","author":[{"given":"Mira","family":"Gonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Weinsberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avishai","family":"Wool","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"24","key":"10.1016\/j.comnet.2008.06.005_bib1","doi-asserted-by":"crossref","first-page":"5234","DOI":"10.1103\/PhysRevLett.85.5234","article-title":"Topology of evolving networks: local events and universality","volume":"85","author":"Albert","year":"2000","journal-title":"Physical Review Letters"},{"key":"10.1016\/j.comnet.2008.06.005_bib2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"Diameter of the World Wide Web","volume":"401","author":"Albert","year":"1999","journal-title":"Nature"},{"key":"10.1016\/j.comnet.2008.06.005_bib3","unstructured":"I. Alvarez-Hamelin, L. Dall\u2019Asta, A. Barrat, A. Vespignani, Large scale networks fingerprinting and visualization using the k-core decomposition, in: Proceedings of the Neural Information Processing Systems, August 2005."},{"key":"10.1016\/j.comnet.2008.06.005_bib4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/jagm.1999.1062","article-title":"Greedily finding a dense subgraph","volume":"34","author":"Asahiro","year":"2000","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.comnet.2008.06.005_bib5","doi-asserted-by":"crossref","unstructured":"S. Bar, M. Gonen, A. Wool, An incremental super-linear preferential Internet topology model, in: Proceedings of the 5th Annual Passive and Active Measurement Workshop (PAM), LNCS 3015, Antibes Juan-les-Pins, France, April 2004, Springer-Verlag, pp. 53\u201362.","DOI":"10.1007\/978-3-540-24668-8_6"},{"issue":"14","key":"10.1016\/j.comnet.2008.06.005_bib6","doi-asserted-by":"crossref","first-page":"4174","DOI":"10.1016\/j.comnet.2007.04.021","article-title":"A geographic directed preferential Internet topology model","volume":"51","author":"Bar","year":"2007","journal-title":"Computer Networks"},{"key":"10.1016\/j.comnet.2008.06.005_bib7","unstructured":"A. Barab\u00e1si and Z. Toroczkai, World-Wide-Web network within nd.edu domain, 1999, <https:\/\/2.zoppoz.workers.dev:443\/http\/www.www.nd.edu\/networks\/resources.htm>."},{"key":"10.1016\/j.comnet.2008.06.005_bib8","doi-asserted-by":"crossref","unstructured":"P. Barford, A. Bestavros, J. Byers, M. Crovella, On the marginal utility of network topology measurements, in: Proceedings of the ACM SIGCOMM, 2001.","DOI":"10.1145\/505202.505204"},{"issue":"4","key":"10.1016\/j.comnet.2008.06.005_bib9","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1209\/epl\/i2001-00260-6","article-title":"Competition and multiscaling in evolving networks","volume":"54","author":"Bianconi","year":"2001","journal-title":"Europhysics Letters"},{"issue":"026118","key":"10.1016\/j.comnet.2008.06.005_bib10","article-title":"Evolving networks with disadvantaged long-range connections","volume":"66","author":"Brunet","year":"2002","journal-title":"Physical Review E"},{"key":"10.1016\/j.comnet.2008.06.005_bib11","unstructured":"T. Bu, D. Towsley, On distinguishing between Internet power-law generators, in: Proceedings of the IEEE INFOCOM\u201902, New York, NY, USA, April 2002."},{"key":"10.1016\/j.comnet.2008.06.005_bib12","unstructured":"S. Carmi, S. Havlin, S. Kirkpatrick, Y. Shavitt, E. Shir, Medusa \u2013 new model of Internet topology using k-shell decomposition, Technical Report, 2006. Available from: arXiv:cond-mat\/0601240v1."},{"issue":"27","key":"10.1016\/j.comnet.2008.06.005_bib13","doi-asserted-by":"crossref","first-page":"11150","DOI":"10.1073\/pnas.0701175104","article-title":"A model of internet topology using k-shell decomposition","volume":"104","author":"Carmi","year":"2007","journal-title":"Proceedings of the National Academy of Sciences USA (PNAS)"},{"key":"10.1016\/j.comnet.2008.06.005_bib14","doi-asserted-by":"crossref","unstructured":"M. Charikar, Greedy approximation algorithms for finding dense components in graphs, in: Proceedings of the APPROX, 2000.","DOI":"10.1007\/3-540-44436-X_10"},{"key":"10.1016\/j.comnet.2008.06.005_bib15","unstructured":"Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, W. Willinger, The origin of power laws in Internet topologies revisited, in: Proceedings of the IEEE INFOCOM\u201902, New York, NY, USA, April 2002."},{"key":"10.1016\/j.comnet.2008.06.005_bib16","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Faloutsos, P. Faloutsos, On power-law relationships of the Internet topology, in: Proceeding of the ACM SIGCOMM\u201999, August 1999, pp. 251\u2013260.","DOI":"10.1145\/316188.316229"},{"issue":"3","key":"10.1016\/j.comnet.2008.06.005_bib17","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","article-title":"The dense k-subgraph problem","volume":"29","author":"Feige","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/j.comnet.2008.06.005_bib18","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jagm.2001.1183","article-title":"Approximation algorithms for maximization problems arising in graph partitioning","volume":"41","author":"Feige","year":"2001","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.comnet.2008.06.005_bib19","unstructured":"U. Feige, M. Seltser, On the densest k-subgraph problem. Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, 1997."},{"key":"10.1016\/j.comnet.2008.06.005_bib20","doi-asserted-by":"crossref","unstructured":"Z. Ge, D.R. Figueiredo, S. Jaiswal, L. Gao, On the hierarchical structure of the logical Internet graph, in: SPIE ITCOM, August 2001.","DOI":"10.1117\/12.434397"},{"key":"10.1016\/j.comnet.2008.06.005_bib21","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","article-title":"Property testing and its connections to learning and approximation","volume":"45","author":"Goldreich","year":"1998","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.comnet.2008.06.005_bib22","doi-asserted-by":"crossref","unstructured":"R. Govindan, H. Tangmunarunki, Heuristics for Internet map discovery, in: Proceedings of the IEEE INFOCOM\u201900, Tel-Aviv, Israel, March 2000, pp. 1371\u20131380.","DOI":"10.1109\/INFCOM.2000.832534"},{"key":"10.1016\/j.comnet.2008.06.005_bib23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1-\u03f5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Mathematica"},{"key":"10.1016\/j.comnet.2008.06.005_bib24","unstructured":"JUNG \u2013 the java universal network\/graph framework, 2007. <https:\/\/2.zoppoz.workers.dev:443\/http\/jung.sourceforge.net\/>."},{"key":"10.1016\/j.comnet.2008.06.005_bib25","doi-asserted-by":"crossref","first-page":"5401","DOI":"10.1103\/PhysRevLett.86.5401","article-title":"Degree distributions of growing networks","volume":"86","author":"Krapivsky","year":"2001","journal-title":"Physical Review Letters"},{"key":"10.1016\/j.comnet.2008.06.005_bib26","unstructured":"A. Lakhina, J.W. Byers, M. Crovella, P. Xie, Sampling biases in IP topology measurements, in: Proceedings of the IEEE INFOCOM\u201903, 2003."},{"key":"10.1016\/j.comnet.2008.06.005_bib27","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/S0378-4371(03)00604-6","article-title":"A local-world evolving network model","volume":"328","author":"Li","year":"2003","journal-title":"Physica A"},{"key":"10.1016\/j.comnet.2008.06.005_bib28","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/B:MACH.0000033117.77257.41","article-title":"A new conceptual clustering framework","volume":"56","author":"Mishra","year":"2004","journal-title":"Machine Learning"},{"issue":"January","key":"10.1016\/j.comnet.2008.06.005_bib29","article-title":"On the power law random graph model of the Internet","volume":"55","author":"Reittu","year":"2004","journal-title":"Performance Evaluation"},{"key":"10.1016\/j.comnet.2008.06.005_bib30","unstructured":"G. Sagie, A. Wool, A clustering approach for exploring the Internet structure, in: Proceedings of the 23rd IEEE Convention of Electrical and Electronics Engineers in Israel (IEEEI), September 2004."},{"key":"10.1016\/j.comnet.2008.06.005_bib31","doi-asserted-by":"crossref","unstructured":"Y. Shavitt, E. Shir, DIMES: Let the Internet measure itself, in: Proceedings of the ACM SIGCOMM, 2005, pp. 71\u201374.","DOI":"10.1145\/1096536.1096546"},{"key":"10.1016\/j.comnet.2008.06.005_bib32","doi-asserted-by":"crossref","DOI":"10.1109\/JCN.2006.6182774","article-title":"Jellyfish: a conceptual model for the as Internet topology","author":"Siganos","year":"2006","journal-title":"Journal of Communications and Networks"},{"key":"10.1016\/j.comnet.2008.06.005_bib33","unstructured":"L. Subramanian, S. Agarwal, J. Rexford, R.H. Katz, Characterizing the Internet hierarchy from multiple vantage points, in: Proceedings of the IEEE INFOCOM\u201902, New York, NY, USA, April 2002."},{"key":"10.1016\/j.comnet.2008.06.005_bib34","unstructured":"H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network topology generators: degree based vs. structural, in: Proceedings of the ACM SIGCOMM, 2002."},{"key":"10.1016\/j.comnet.2008.06.005_bib35","unstructured":"L. Tauro, C. Palmer, G. Siganos, M. Faloutsos, A simple conceptual model for Internet topology, in: IEEE Global Internet, San Antonio, TX, November 2001."},{"issue":"February","key":"10.1016\/j.comnet.2008.06.005_bib36","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1073\/pnas.012583099","article-title":"Scaling phenomena in the Internet: critically examining criticality","volume":"99","author":"Willinger","year":"2002","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"10.1016\/j.comnet.2008.06.005_bib37","unstructured":"J. Winick, S. Jamin, Inet-3.0: Internet topology generator, Technical Report UM-CSE-TR-456-02, Department of EECS, University of Michigan, 2002."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128608001928?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128608001928?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T18:13:39Z","timestamp":1738260819000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128608001928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":37,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["S1389128608001928"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2008.06.005","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}