{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:51:02Z","timestamp":1782949862397,"version":"3.54.5"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,9,27]],"date-time":"2012-09-27T00:00:00Z","timestamp":1348704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10115-012-0539-0","type":"journal-article","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T16:52:39Z","timestamp":1348678359000},"page":"311-343","source":"Crossref","is-referenced-by-count":74,"title":["D-cores: measuring collaboration of directed graphs based on degeneracy"],"prefix":"10.1007","volume":"35","author":[{"given":"Christos","family":"Giatsidis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,27]]},"reference":[{"key":"539_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba RD (1973) A graph-theoretic definition of a sociometric clique. J Math Sociol 3:113\u2013126","journal-title":"J Math Sociol"},{"key":"539_CR2","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, Vespignani A (2005) $$k$$ -core decomposition: a tool for the visualization of large scale networks. CoRR, cs.NI\/0504107"},{"key":"539_CR3","first-page":"41","volume-title":"Advances in neural information processing systems","author":"JI Alvarez-Hamelin","year":"2006","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, Vespignani A (2006) Large scale networks fingerprinting and visualization using the $$k$$ -core decomposition. In: Weiss Y, Sch\u00f6lkopf B, Platt J (eds) Advances in neural information processing systems, vol 18. MIT Press, Cambridge, pp 41\u201350"},{"key":"539_CR4","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1007\/s10115-003-0128-3","volume":"6","author":"Y An","year":"2004","unstructured":"An Y, Janssen J, Milios EE (2004) Characterizing and mining the citation graph of the computer science literature. Knowl Inf Syst 6:664\u2013678. doi: 10.1007\/s10115-003-0128-3","journal-title":"Knowl Inf Syst"},{"key":"539_CR5","doi-asserted-by":"crossref","unstructured":"Bader GD, Hogue CWV (2003) An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformat 4:1\u20131","DOI":"10.1186\/1471-2105-4-2"},{"key":"539_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"539_CR7","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si A-L, Albert R, Jeong H (2000) Scale-free characteristics of random networks: the topology of the world-wide web. Phys A Stat Mech Appl 281:69\u201377","DOI":"10.1016\/S0378-4371(00)00018-2"},{"key":"539_CR8","first-page":"8","volume-title":"Graph Drawing, volume 2265 of Lecture Notes in Computer Science","author":"V Batagelj","year":"2002","unstructured":"Batagelj V, Mrvar A (2002) Pajek\u2014analysis and visualization of large networks. In: Mutzel P, J\u00fcnger M, Leipert S (eds) Graph Drawing, volume 2265 of Lecture Notes in Computer Science. Springer, Berlin, pp 8\u201311"},{"key":"539_CR9","unstructured":"Batagelj V, Zaversnik M (2002) Generalized cores. CoRR, cs.DS\/0202039"},{"key":"539_CR10","unstructured":"Baur M, Gaertler M, G\u00f6rke R, Krug M, Wagner D (2007) Generating graphs with predefined $$k$$ -core structure. In: Proceedings of the European conference of complex systems (ECCS\u201907), Oct. 2007"},{"key":"539_CR11","unstructured":"Bollobas B, Borgs C, Chayes J, Riordan O (2003) Directed scale-free graph. In: Proceedings of 14th ACM-SIAM symposium on discrete algorithms, pp 132\u2013139"},{"key":"539_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B, Riordan O (2004) The diameter of a scale-free random graph. Combinatorica 24:5\u201334","journal-title":"Combinatorica"},{"issue":"3","key":"539_CR13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B Bollobs","year":"2001","unstructured":"Bollobs B, Riordan O, Spencer J, Tusn\u00e1dy G (2001) The degree sequence of a scale-free random graph process. Random Struct Algorithms 18(3):279\u2013290","journal-title":"Random Struct Algorithms"},{"key":"539_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.disc.2003.10.020","volume":"282","author":"PG Buckley","year":"2001","unstructured":"Buckley PG, Osthus D (2001) Popularity based random graph models leading to a scale-free degree sequence. Discrete Math 282:53\u201368","journal-title":"Discrete Math"},{"key":"539_CR15","unstructured":"Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2006) MEDUSA\u2014new model of internet topology using k-shell decomposition, arXiv:cond-mat\/0601240"},{"key":"539_CR16","unstructured":"Charikar M, (2000) Greedy approximation algorithms for finding dense components in a graph. In: Approximation algorithms for combinatorial optimization (Saarbr\u00fccken), (2000) volume 1913 of Lecture Notes in Computer Science. Springer, Berlin, pp 84\u201395"},{"key":"539_CR17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/rsa.10084","volume":"22","author":"C Cooper","year":"2003","unstructured":"Cooper C, Frieze A (2003) A general model of web graphs. Random Struct Algorithms 22:311\u2013335","journal-title":"Random Struct Algorithms"},{"key":"539_CR18","volume-title":"Graph theory, volume 173 of Graduate texts in mathematics","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory, volume 173 of Graduate texts in mathematics. Springer, Berlin"},{"key":"539_CR19","doi-asserted-by":"crossref","first-page":"040601","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"SN Dorogovtsev","year":"2006","unstructured":"Dorogovtsev SN, Goltsev AV, Mendes JFF (2006) $$k$$ -core organization of complex networks. Phys Rev Lett 96:040601","journal-title":"Phys Rev Lett"},{"issue":"21","key":"539_CR20","doi-asserted-by":"crossref","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","volume":"85","author":"SN Dorogovtsev","year":"2000","unstructured":"Dorogovtsev SN, Mendes JFF, Samukhin AN (2000) Structure of growing networks with preferential linking. Phys Rev Lett 85(21):4633\u20134636","journal-title":"Phys Rev Lett"},{"key":"539_CR21","unstructured":"Drinea E, Enachescu M, Mitzenmacher M (2001) Variations on random graph models for the web. Computer Science Group Harvard University, Cambridge"},{"key":"539_CR22","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BF02759702","volume":"1","author":"P Erd\u0151s","year":"1963","unstructured":"Erd\u0151s P (1963) On the structure of linear graphs. Israel J Math 1:156\u2013160","journal-title":"Israel J Math"},{"key":"539_CR23","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A (1960) On the evolution of random graphs. Magyar Tud Akad Mat Kutat\u00f3 Int K\u00f6zl 5:17\u201361","journal-title":"Magyar Tud Akad Mat Kutat\u00f3 Int K\u00f6zl"},{"key":"539_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0378-8733(96)00295-X","volume":"19","author":"M Fershtman","year":"1997","unstructured":"Fershtman M (1997) Cohesive group detection in a social network by the segregation matrix index. Social Netw 19:193\u2013207","journal-title":"Social Netw"},{"issue":"3\u20135","key":"539_CR25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"539_CR26","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0378-8733(94)00247-8","volume":"17","author":"KA Frank","year":"1995","unstructured":"Frank KA (1995) Identifying cohesive subgroups. Social Netw 17:27\u201356","journal-title":"Social Netw"},{"issue":"1","key":"539_CR27","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder EC (1982) A sufficient condition for backtrack-free search. J Assoc Comput Mach 29(1):24\u201332","journal-title":"J Assoc Comput Mach"},{"key":"539_CR28","doi-asserted-by":"crossref","unstructured":"Giatsidis C, Thilikos DM, Vazirgiannis M (2011) D-cores: measuring collaboration of directed graphs based on degeneracy. In: ICDM, pp 201\u2013210","DOI":"10.1109\/ICDM.2011.46"},{"key":"539_CR29","doi-asserted-by":"crossref","unstructured":"Giatsidis C, Thilikos DM, Vazirgiannis M (2011) Evaluating cooperation in communities with the $$k$$ -core structure. In: ASONAM. IEEE Computer Society, pp 87\u201393","DOI":"10.1109\/ASONAM.2011.65"},{"key":"539_CR30","unstructured":"Healy J, Janssen J, Milios E, Aiello W (2008) Characterization of graphs using degree cores. In: Algorithms and models for the Web-Graph: fourth international workshop, WAW 2006, volume LNCS-4936 of Lecture notes in computer science. Springer, Banff, Nov. 30\u2013Dec. 1, 2008"},{"key":"539_CR31","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10115-008-0135-5","volume":"17","author":"V Kandylas","year":"2008","unstructured":"Kandylas V, Upham S, Ungar L (2008) Finding cohesive clusters for analyzing knowledge communities. Knowl Inf Syst 17:335\u2013354. doi: 10.1007\/s10115-008-0135-5","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"539_CR32","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/S0097539793255709","volume":"25","author":"LM Kirousis","year":"1996","unstructured":"Kirousis LM, Thilikos DM (1996) The linkage of a graph. SIAM J Comput 25(3):626\u2013647","journal-title":"SIAM J Comput"},{"key":"539_CR33","doi-asserted-by":"crossref","unstructured":"Kumar R, Raghavan P, Rajagopalan S, Sivakumar D, Tomkins A, Upfal E (2000) Stochastic models for the web graph. In: Proceedings of the 41st annual symposium on foundations of computer science. IEEE Computer Society . Washington, DC, USA, p 57","DOI":"10.1109\/SFCS.2000.892065"},{"key":"539_CR34","unstructured":"Kumar R, Raghavan P, Rajagopalan S, Tomkins A (1999) Extracting large-scale knowledge bases from the web. In: VLDB \u201999: proceedings of the 25th international conference on very large data bases. Morgan Kaufmann, San Francisco, pp 639\u2013650"},{"key":"539_CR35","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"D Luce","year":"1950","unstructured":"Luce D (1950) Connectivity and generalized cliques in sociometric group structure. Psychometrika 15:169\u2013190","journal-title":"Psychometrika"},{"key":"539_CR36","first-page":"481","volume":"10","author":"DW Matula","year":"1968","unstructured":"Matula DW (1968) A min-max theorem for graphs with application to graph coloring. SIAM Rev 10:481\u2013482","journal-title":"SIAM Rev"},{"key":"539_CR37","doi-asserted-by":"crossref","unstructured":"Matula DW, Marble G, Isaacson JD (1972) Graph coloring algorithms. In: Graph theory and computing. Academic Press, New York, pp 109\u2013122","DOI":"10.1016\/B978-1-4832-3187-7.50015-5"},{"issue":"1","key":"539_CR38","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/3088904","volume":"68","author":"J Moody","year":"2007","unstructured":"Moody J, White DR (2007) Structural cohesion and embeddedness: a hierarchical concept of social groups. Am Sociol Rev 68(1):103\u2013127","journal-title":"Am Sociol Rev"},{"key":"539_CR39","doi-asserted-by":"crossref","unstructured":"Papadimitriou S, Sun J, Faloutsos C, Yu PS (2008) Hierarchical, parameter-free community discovery. In: ECML\/PKDD (2), pp 170\u2013187","DOI":"10.1007\/978-3-540-87481-2_12"},{"issue":"1","key":"539_CR40","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B Pittel","year":"1996","unstructured":"Pittel B, Spencer J, Wormald N (1996) Sudden emergence of a giant $$k$$ -core in a random graph. J Combinatorial Theory Ser B 67(1):111\u2013151","journal-title":"J Combinatorial Theory Ser B"},{"issue":"3","key":"539_CR41","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Social Netw 5(3):269\u2013287","journal-title":"Social Netw"},{"key":"539_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0021-9800(68)80081-X","volume":"4","author":"G Szekeres","year":"1968","unstructured":"Szekeres G, Wilf HS (1968) An inequality for the chromatic number of a graph. J Combinatorial Theory 4:1\u20133","journal-title":"J Combinatorial Theory"},{"key":"539_CR43","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social networks analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social networks analysis: methods and applications. Cambridge University Press, Cambridge"},{"key":"539_CR44","doi-asserted-by":"crossref","unstructured":"Wuchty S, Almaas E (2005) Peeling the yeast protein network. Proteomics 5(2):444\u2013449","DOI":"10.1002\/pmic.200400962"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0539-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0539-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0539-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T06:57:58Z","timestamp":1562223478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0539-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,27]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["539"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0539-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,27]]}}}