{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:18:53Z","timestamp":1725632333893},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255007"},{"type":"electronic","value":"9783642255014"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25501-4_3","type":"book-chapter","created":{"date-parts":[[2011,11,10]],"date-time":"2011-11-10T07:01:47Z","timestamp":1320908507000},"page":"22-34","source":"Crossref","is-referenced-by-count":2,"title":["Fully Generalized Graph Cores"],"prefix":"10.1007","author":[{"given":"Alexandre P.","family":"Francisco","sequence":"first","affiliation":[]},{"given":"Arlindo L.","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S.B. Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Networks\u00a05(3), 269\u2013287 (1983)","journal-title":"Social Networks"},{"key":"3_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: Methods and applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social network analysis: Methods and applications. Cambridge University Press, Cambridge (1994)"},{"key":"3_CR3","unstructured":"Batagelj, V., Zaver\u0161nik, M.: Generalized cores. arXiv:cs\/0202039 (2002)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-define clusters. arXiv:0810.1355 (2008)","DOI":"10.1080\/15427951.2009.10129177"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11280-009-0060-x","volume":"12","author":"F. Wei","year":"2009","unstructured":"Wei, F., Qian, W., Wang, C., Zhou, A.: Detecting Overlapping Community Structures in Networks. World Wide Web\u00a012(2), 235\u2013261 (2009)","journal-title":"World Wide Web"},{"key":"3_CR6","volume-title":"Graph partitioning for high-performance scientific simulations","author":"K. Schloegel","year":"2003","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high-performance scientific simulations. Morgan Kaufmann Publishers, Inc., San Francisco (2003)"},{"key":"3_CR7","first-page":"10","volume-title":"IEEE International Parallel & Distributed Processing Symposium","author":"A. Abou-Rjeili","year":"2006","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: IEEE International Parallel & Distributed Processing Symposium, p. 10. IEEE, Los Alamitos (2006)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435, 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"6","key":"3_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1088\/1367-2630\/9\/6\/180","volume":"9","author":"I. Farkas","year":"2007","unstructured":"Farkas, I., \u00c1bel, D., Palla, G., Vicsek, T.: Weighted network modules. New J. Physics\u00a09(6), 180 (2007)","journal-title":"New J. Physics"},{"issue":"8","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H. Shen","year":"2009","unstructured":"Shen, H., Cheng, X., Cai, K., Hu, M.B.: Detect overlapping and hierarchical community structure in networks. Physica A: Statistical Mechanics and its Applications\u00a0388(8), 1706\u20131712 (2009)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"3304","DOI":"10.1093\/ietfec\/e91-a.11.3304","volume":"91","author":"K. Saito","year":"2008","unstructured":"Saito, K., Yamada, T., Kazama, K.: Extracting Communities from Complex Networks by the k-dense Method. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a091, 3304\u20133311 (2008)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Blocks of Ccomplex Networks. Science\u00a0298, 824\u2013827 (2002)","journal-title":"Science"},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1093\/bioinformatics\/btg070","volume":"19","author":"R. Saito","year":"2002","unstructured":"Saito, R., Suzuki, H., Hayashizaki, Y.: Construction of reliable protein-protein interaction networks with a new interaction generality measure. Bioinformatics\u00a019(6), 756\u2013763 (2002)","journal-title":"Bioinformatics"},{"issue":"18","key":"3_CR14","doi-asserted-by":"publisher","first-page":"3346","DOI":"10.1093\/bioinformatics\/bth402","volume":"20","author":"I. Albert","year":"2004","unstructured":"Albert, I., Albert, R.: Conserved network motifs allow protein-protein interaction prediction. Bioinformatics\u00a020(18), 3346\u20133352 (2004)","journal-title":"Bioinformatics"},{"issue":"11","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N. Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics\u00a020(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"issue":"9","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M. Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. IEEE Transactions on Knowledge and Data Engineering\u00a016(9), 1038\u20131051 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1186\/1471-2105-9-70","volume":"9","author":"T. Milenkovi\u0107","year":"2008","unstructured":"Milenkovi\u0107, T., Lai, J., Pr\u017eulj, N.: Graphcrunch: a tool for large network analyses. BMC Bioinformatics\u00a09(1), 70 (2008)","journal-title":"BMC Bioinformatics"},{"key":"3_CR18","first-page":"241","volume":"37","author":"P. Jaccard","year":"1901","unstructured":"Jaccard, P.: Distribution de la flore alpine dans le Bassin des Dranses et dans quelques regions voisines. Bull. Soc. Vaud. Sci. Nat.\u00a037, 241\u2013272 (1901)","journal-title":"Bull. Soc. Vaud. Sci. Nat."},{"key":"3_CR19","unstructured":"Tanimoto, T.T.: IBM Internal Report November 17th. Technical report, IBM (1957)"},{"key":"3_CR20","first-page":"824","volume-title":"SIGKDD","author":"X. Xu","year":"2007","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: SIGKDD, pp. 824\u2013833. ACM, New York (2007)"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney, H.: On the abstract properties of linear dependence. American Journal of Mathematics\u00a057(3), 509\u2013533 (1935)","journal-title":"American Journal of Mathematics"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.6028\/jres.069B.001","volume":"69","author":"W.T. Tutte","year":"1965","unstructured":"Tutte, W.T.: Lectures on matroids. J. Res. Nat. Bur. Stand. B\u00a069, 1\u201347 (1965)","journal-title":"J. Res. Nat. Bur. Stand. B"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the AMS\u00a07(1), 48\u201350 (1956)","journal-title":"Proceedings of the AMS"},{"key":"3_CR24","unstructured":"Bor\u016fvka, O.: On a minimal problem. Prace Morask\u00e9 Pridovedeck\u00e9 Spolecnosti 3 (1926)"},{"key":"3_CR25","unstructured":"Spielman, D.A., Teng, S.H.: A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. arXiv.org:0809.3232 (2008)"},{"key":"3_CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/1135777.1135814","volume-title":"WWW","author":"R. Andersen","year":"2006","unstructured":"Andersen, R., Lang, K.J.: Communities from seed sets. In: WWW, pp. 223\u2013232. ACM, New York (2006)"},{"issue":"50","key":"3_CR27","doi-asserted-by":"publisher","first-page":"19735","DOI":"10.1073\/pnas.0708838104","volume":"104","author":"F. Chung","year":"2007","unstructured":"Chung, F.: The heat kernel as the pagerank of a graph. PNAS\u00a0104(50), 19735\u201319740 (2007)","journal-title":"PNAS"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"33015","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A. Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S., Kert\u00e9sz, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Physics\u00a011, 33015 (2009)","journal-title":"New J. Physics"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 10008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"}],"container-title":["Communications in Computer and Information Science","Complex Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25501-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T06:49:09Z","timestamp":1560926949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25501-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255007","9783642255014"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25501-4_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}