{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:41:54Z","timestamp":1753440114939},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_56","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"664-676","source":"Crossref","is-referenced-by-count":15,"title":["External-Memory Network Analysis Algorithms for Naturally Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Pszona","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"56_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/s00453-008-9204-0","volume":"54","author":"N. Alon","year":"2009","unstructured":"Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica\u00a054(4), 544\u2013556 (2009)","journal-title":"Algorithmica"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01788542","volume":"3","author":"N. Alon","year":"1987","unstructured":"Alon, N., Kahn, J., Seymour, P.D.: Large induced degenerate subgraphs. Graphs and Combinatorics\u00a03, 203\u2013211 (1987)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"56_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica\u00a017(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"5439","key":"56_CR4","doi-asserted-by":"publisher","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.: Emergence of scaling in random networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"56_CR5","unstructured":"Batagelj, V., Zaver\u0161nik, M.: An O(m) algorithm for cores decomposition of networks (2003), http:\/\/arxiv.org\/abs\/cs.DS\/0310049"},{"key":"56_CR6","first-page":"90","volume-title":"7th Workshop on Analytic Algorithmics and Combinatorics (ANALCO)","author":"R. Bauer","year":"2010","unstructured":"Bauer, R., Krug, M., Wagner, D.: Enumerating and generating labeled k-degenerate graphs. In: 7th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 90\u201398. SIAM, Philadelphia (2010)"},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B. Bollob\u00e1s","year":"1904","unstructured":"Bollob\u00e1s, B.: On generalized graphs. Acta Mathematica Hungarica\u00a016, 447\u2013452 (1904), doi:10.1007\/BF01904851","journal-title":"Acta Mathematica Hungarica"},{"issue":"9","key":"56_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM\u00a016(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., Ozsu, T.: Efficient core decomposition in massive networks. In: IEEE Int. Conf. on Data Engineering, ICDE (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"2","key":"56_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci.\u00a086(2), 243\u2013266 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"56_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0378-8733(94)90013-2","volume":"16","author":"P. Doreian","year":"1994","unstructured":"Doreian, P., Woodard, K.L.: Defining and locating cores and boundaries of social networks. Social Networks\u00a016(4), 267\u2013293 (1994)","journal-title":"Social Networks"},{"key":"56_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","volume-title":"Algorithms and Computation","author":"D. Eppstein","year":"2010","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol.\u00a06506, pp. 403\u2013414. Springer, Heidelberg (2010)"},{"key":"56_CR13","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. arXiv eprint, 1103.0318 (2011)","DOI":"10.1007\/978-3-642-20662-7_31"},{"issue":"1-2","key":"56_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Hajnal, A.: On chromatic number of graphs and set-systems. Acta Mathematica Hungarica\u00a017(1-2), 61\u201399 (1966)","journal-title":"Acta Mathematica Hungarica"},{"key":"56_CR15","unstructured":"Fernholz, D., Ramachandran, V.: The giant k-core of a random graph with a specified degree sequence (2003) (manuscript)"},{"key":"56_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E.C. Freuder","year":"1982","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-free search. J. ACM\u00a029, 24\u201332 (1982)","journal-title":"J. ACM"},{"key":"56_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-92248-3_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P.A. Golovach","year":"2008","unstructured":"Golovach, P.A., Villanger, Y.: Parameterized complexity for domination problems on degenerate graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 195\u2013205. Springer, Heidelberg (2008)"},{"key":"56_CR18","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Pszona, P.: External-memory network analysis algorithms for naturally sparse graphs. arXiv eprint, 1106.6336 (2011)","DOI":"10.1007\/978-3-642-23719-5_56"},{"key":"56_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01294263","volume":"11","author":"S. Irani","year":"1994","unstructured":"Irani, S.: Coloring inductive graphs on-line. Algorithmica\u00a011, 53\u201372 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"56_CR20","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/S0097539793255709","volume":"25","author":"L.M. Kirousis","year":"1996","unstructured":"Kirousis, L.M., Thilikos, D.M.: The linkage of a graph. SIAM Journal on Computing\u00a025(3), 626\u2013647 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"56_CR21","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: 32nd ACM Symp. on Theory of Computing (STOC), pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"56_CR22","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"D.R. Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: k-degenerate graphs. Canadian Journal of Mathematics\u00a022, 1082\u20131096 (1970)","journal-title":"Canadian Journal of Mathematics"},{"key":"56_CR23","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to find long paths efficiently. Annals of Discrete Mathematics\u00a025, 239\u2013254 (1985)","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"56_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B. Pittel","year":"1996","unstructured":"Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant k-core in a random graph. Journal of Combinatorial Theory, Series B\u00a067(1), 111\u2013151 (1996)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"56_CR25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1017\/S0963548307008589","volume":"17","author":"O. Riordan","year":"2008","unstructured":"Riordan, O.: The k-core and branching processes. Probability And Computing\u00a017, 111 (2008)","journal-title":"Probability And Computing"},{"issue":"3","key":"56_CR26","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"},{"issue":"1","key":"56_CR27","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci.\u00a0363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"56_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv.\u00a033, 209\u2013271 (2001)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:07:58Z","timestamp":1560528478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}