{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:52:40Z","timestamp":1755838360697},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319054001"},{"type":"electronic","value":"9783319054018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05401-8_13","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T10:19:39Z","timestamp":1392891579000},"page":"129-140","source":"Crossref","is-referenced-by-count":3,"title":["Core Decomposition in Directed Networks: Kernelization and Strong Connectivity"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Levorato","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1134271.1134277","volume-title":"Proceedings of the 3rd International Workshop on Link Discovery (LinkKDD 2005)","author":"L.A. Adamic","year":"2005","unstructured":"Adamic, L.A., Glance, N.: The political blogosphere and the 2004 u.s. election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery (LinkKDD 2005), pp. 36\u201343. ACM, New York (2005)"},{"unstructured":"Berge, C.: Graphes et Hypergraphes. Dunod, Paris (1970)","key":"13_CR2"},{"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\u00a0(10) (2008)","key":"13_CR3","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"doi-asserted-by":"crossref","unstructured":"Cheng, J., Romero, D.M., Meeder, B., Kleinberg, J.M.: Predicting reciprocity in social networks. In: SocialCom\/PASSAT, pp. 49\u201356 (2011)","key":"13_CR4","DOI":"10.1109\/PASSAT\/SocialCom.2011.110"},{"issue":"6","key":"13_CR5","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E\u00a070(6), 066111 (2004)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Danon, L., D\u00edaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. Journal of Statistical Mechanics: Theory and Experiment\u00a0(9), P09008\u2013P09008 (2005)","key":"13_CR6","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th revised edn. Springer (July 2010)","key":"13_CR7","DOI":"10.1007\/978-3-642-14279-6"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-04128-0_55","volume-title":"Algorithms - ESA 2009","author":"R. Fleischer","year":"2009","unstructured":"Fleischer, R., Wu, X., Yuan, L.: Experimental study of fpt algorithms for the directed feedback vertex set problem. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 611\u2013622. Springer, Heidelberg (2009)"},{"issue":"3-5","key":"13_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports\u00a0486(3-5), 74\u2013174 (2010)","journal-title":"Physics Reports"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S. Fortunato","year":"2006","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. Proceedings of the National Academy of Science\u00a0104(1), 36\u201341 (2006)","journal-title":"Proceedings of the National Academy of Science"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1038\/nature03288","volume":"433","author":"R. Guimer\u00e0","year":"2005","unstructured":"Guimer\u00e0, R., Nunes Amaral, L.A.: Functional cartography of complex metabolic networks. Nature\u00a0433, 895\u2013900 (2005)","journal-title":"Nature"},{"key":"13_CR12","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"doi-asserted-by":"crossref","unstructured":"Labatut, V., Balasque, J.-M.: Detection and interpretation of communities in complex networks: Practical methods and application. In: Computational Social Networks: Tools, Perspectives and Applications, pp. 81\u2013113 (2012)","key":"13_CR13","DOI":"10.1007\/978-1-4471-4048-1_4"},{"issue":"12","key":"13_CR14","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1016\/j.physa.2010.02.014","volume":"389","author":"D. Lai","year":"2010","unstructured":"Lai, D., Lu, H., Nardini, C.: Finding communities in directed networks by pagerank random walk induced network embedding. Physica A: Statistical Mechanics and its Applications\u00a0389(12), 2443\u20132454 (2010)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"017102","DOI":"10.1103\/PhysRevE.84.017102","volume":"84","author":"R. Lambiotte","year":"2011","unstructured":"Lambiotte, R., Sinatra, R., Delvenne, J.-C., Evans, T.S., Barahona, M., Latora, V.: Flow graphs: Interweaving dynamics and structure. Phys. Rev. E\u00a084, 017102 (2011)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A. Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E\u00a080(1), 1\u20138 (2009)","journal-title":"Physical Review E"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A. Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Community detection algorithms: A comparative analysis. Phys. Rev. E\u00a080, 056117 (2009)","journal-title":"Phys. Rev. E"},{"issue":"11","key":"13_CR18","doi-asserted-by":"publisher","first-page":"118703","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"E.A. Leicht","year":"2008","unstructured":"Leicht, E.A., Newman, M.E.J.: Community structure in directed networks. Phys. Rev. Lett.\u00a0100(11), 118703 (2008)","journal-title":"Phys. Rev. Lett."},{"doi-asserted-by":"crossref","unstructured":"Levorato, V., Petermann, C.: Detection of communities in directed networks based on strongly p-connected components. In: IEEE International Conference on Computational Aspects of Social Networks (CASoN), pp. 211\u2013216 (October 2011)","key":"13_CR19","DOI":"10.1109\/CASON.2011.6085946"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R.J. Mokken","year":"1979","unstructured":"Mokken, R.J.: Cliques, clubs and clans. Quality & Quantity\u00a013(2), 161\u2013173 (1979)","journal-title":"Quality & Quantity"},{"key":"13_CR21","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"},{"unstructured":"Rosenberg, A., Hirschberg, J.: V-measure: A conditional entropy-based external cluster evaluation measure. In: Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pp. 410\u2013420 (2007)","key":"13_CR22"},{"doi-asserted-by":"crossref","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. In: Proceedings of the National Academy of Sciences USA, pp. 1118\u20131123 (2008)","key":"13_CR23","DOI":"10.1073\/pnas.0706851105"},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"046112","DOI":"10.1103\/PhysRevE.77.046112","volume":"77","author":"P. Schuetz","year":"2008","unstructured":"Schuetz, P., Caflisch, A.: Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E\u00a077, 046112 (2008)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"13_CR25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","volume":"29","author":"P. Sen","year":"2008","unstructured":"Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine\u00a029(3), 93\u2013106 (2008)","journal-title":"AI Magazine"},{"issue":"3","key":"13_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R. Tarjan","year":"1973","unstructured":"Tarjan, R.: Enumeration of the Elementary Circuits of a Directed Graph. SIAM Journal on Computing\u00a02(3), 211\u2013216 (1973)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"13_CR27","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), Philadelphia, PA, USA, pp. 115\u2013119. Society for Industrial and Applied Mathematics (2009)","key":"13_CR28","DOI":"10.1137\/1.9781611973068.13"},{"issue":"1","key":"13_CR29","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/040608635","volume":"30","author":"S. Dongen Van","year":"2008","unstructured":"Van Dongen, S.: Graph clustering via a discrete uncoupling process. SIAM. J. Matrix Anal. & Appl.\u00a030(1), 121\u2013141 (2008)","journal-title":"SIAM. J. Matrix Anal. & Appl."},{"doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press (1994)","key":"13_CR30","DOI":"10.1017\/CBO9780511815478"},{"issue":"2","key":"13_CR31","first-page":"331","volume":"38","author":"F. Wu","year":"2003","unstructured":"Wu, F., Huberman, B.A.: Finding communities in linear time: A physics approach. The European Physical Journal B Condensed Matter\u00a038(2), 331\u2013338 (2003)","journal-title":"The European Physical Journal B Condensed Matter"},{"doi-asserted-by":"crossref","unstructured":"Yang, T., Chi, Y., Zhu, S., Jin, R.: Directed network community detection: A popularity and productivity link model. In: SDM 2010: Proceedings of the 2010 SIAM International Conference on Data Mining (2010)","key":"13_CR32","DOI":"10.1137\/1.9781611972801.65"}],"container-title":["Studies in Computational Intelligence","Complex Networks V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05401-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:55:52Z","timestamp":1558860952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05401-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319054001","9783319054018"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05401-8_13","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]}}}