{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:30Z","timestamp":1759638090285},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_25","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"278-289","source":"Crossref","is-referenced-by-count":25,"title":["The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emma S.","family":"Spiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Adler, R., Ewing, J., Taylor, P.: Citation Statistics: A report from the International Mathematical Union (IMU) in cooperation with the International Council of Industrial and Applied Mathematics (ICIAM) and the Institute of Mathematical Statistics. In: Joint Committee on Quantitative Assessment of Research (2008)","key":"25_CR1","DOI":"10.1214\/09-STS285REJ"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barabasi, A.-L.: The diameter of the world wide web. Nature\u00a0401, 130\u2013131 (1999)","journal-title":"Nature"},{"issue":"3","key":"25_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"},{"unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets (2006), http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/","key":"25_CR4"},{"unstructured":"Borgatti, S.P., Everett, M.G., Freeman, L.C.: UCINet 6 for Windows: Software for social network analysis. Analytic Technologies, Harvard, MA (2002)","key":"25_CR5"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput.\u00a014(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"unstructured":"DuBois, C.L., Smyth, P.: UCI Network Data Repository (2008), http:\/\/networkdata.ics.uci.edu","key":"25_CR8"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0097539793247634","volume":"24","author":"R.A. Duke","year":"1995","unstructured":"Duke, R.A., Lefmann, H., R\u00f6dl, V.: A fast approximation algorithm for computing the frequencies of subgraphs in a given graph. SIAM J. Comput.\u00a024(3), 598\u2013620 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"25_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2004.05.009","volume":"326","author":"F. Eisenbrand","year":"2004","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science\u00a0326(1\u20133), 57\u201367 (2004)","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1002\/jgt.3190170314","volume":"17","author":"D. Eppstein","year":"1993","unstructured":"Eppstein, D.: Connectivity, graph minors, and subgraph multiplicity. Journal of Graph Theory\u00a017, 409\u2013416 (1993)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Information Processing Letters\u00a051(4), 207\u2013211 (1994)","journal-title":"Information Processing Letters"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms & Applications\u00a03(3), 1\u201327 (1999)","journal-title":"Journal of Graph Algorithms & Applications"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica\u00a027, 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"25_CR15","volume-title":"Algorithms and Theory of Computation Handbook","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Atallah, M.J. (ed.) Algorithms and Theory of Computation Handbook, ch.\u00a08, CRC Press, Boca Raton (1999)"},{"doi-asserted-by":"crossref","unstructured":"Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. Electronic preprint arxiv:0904.3741 (2009)","key":"25_CR16","DOI":"10.1007\/978-3-642-03367-4_25"},{"key":"25_CR17","volume-title":"Handbook of Discrete and Combinatorial Mathematics","author":"J. Feigenbaum","year":"2000","unstructured":"Feigenbaum, J., Kannan, S.: Dynamic graph algorithms. In: Rosen, K. (ed.) Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/j.1467-9574.1991.tb01310.x","volume":"45","author":"O. Frank","year":"1999","unstructured":"Frank, O.: Statistical analysis of change in networks. Statistica Neerlandica\u00a045, 283\u2013293 (1999)","journal-title":"Statistica Neerlandica"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","volume":"81","author":"O. Frank","year":"1986","unstructured":"Frank, O., Strauss, D.: Markov graphs. J. Amer. Statistical Assoc.\u00a081, 832\u2013842 (1986)","journal-title":"J. Amer. Statistical Assoc."},{"unstructured":"Handcock, M.S., Hunter, D., Butts, C.T., Goodreau, S.M., Morris, M.: statnet: An R package for the Statistical Modeling of Social Networks (2003), http:\/\/www.csde.washington.edu\/statnet","key":"25_CR20"},{"issue":"46","key":"25_CR21","doi-asserted-by":"publisher","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"J.E. Hirsch","year":"2005","unstructured":"Hirsch, J.E.: An index to quantify an individual\u2019s scientific research output. Proc. National Academy of Sciences\u00a0102(46), 16569\u201316572 (2005)","journal-title":"Proc. National Academy of Sciences"},{"issue":"4","key":"25_CR22","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput.\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"25_CR23","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":"3\u20134","key":"25_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T. Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Finding and counting small induced subgraphs efficiently. Information Processing Letters\u00a074(3\u20134), 115\u2013121 (2000)","journal-title":"Information Processing Letters"},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1038\/35082140","volume":"411","author":"F. Liljeros","year":"2001","unstructured":"Liljeros, F., Edling, C.R., Amaral, L.A.N., Stanley, H.E., \u00c5berg, Y.: The web of human sexual contacts. Nature\u00a0411, 907\u2013908 (2001)","journal-title":"Nature"},{"issue":"2","key":"25_CR26","first-page":"415","volume":"26","author":"J. Ne\u0161et\u0159il","year":"1985","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae\u00a026(2), 415\u2013419 (1985)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045, 167\u2013256 (2003)","journal-title":"SIAM Review"},{"issue":"3683","key":"25_CR28","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1126\/science.149.3683.510","volume":"149","author":"D.J. desolla Price","year":"1965","unstructured":"desolla Price, D.J.: Networks of scientific papers. Science\u00a0149(3683), 510\u2013515 (1965)","journal-title":"Science"},{"issue":"8","key":"25_CR29","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1093\/bioinformatics\/btl030","volume":"22","author":"N. Pr\u017eulj","year":"2006","unstructured":"Pr\u017eulj, N., Corneil, D.G., Jurisica, I.: Efficient estimation of graphlet frequency distributions in protein\u2013protein interaction networks. Bioinformatics\u00a022(8), 974\u2013980 (2006)","journal-title":"Bioinformatics"},{"issue":"2","key":"25_CR30","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.socnet.2006.08.004","volume":"29","author":"G. Robins","year":"2007","unstructured":"Robins, G., Morris, M.: Advances in exponential random graph (p*) models. Social Networks\u00a029(2), 169\u2013172 (2007); Special issue of journal with four additional articles","journal-title":"Social Networks"},{"issue":"2","key":"25_CR31","first-page":"1","volume":"3","author":"T.A.B. Snijders","year":"2002","unstructured":"Snijders, T.A.B.: Markov chain Monte Carlo estimation of exponential random graph models. Journal of Social Structure\u00a03(2), 1\u201340 (2002)","journal-title":"Journal of Social Structure"},{"issue":"1","key":"25_CR32","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1111\/j.1467-9531.2006.00176.x","volume":"36","author":"T.A.B. Snijders","year":"2006","unstructured":"Snijders, T.A.B., Pattison, P.E., Robins, G., Handcock, M.S.: New specifications for exponential random graph models. Sociological Methodology\u00a036(1), 99\u2013153 (2006)","journal-title":"Sociological Methodology"},{"key":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/3-540-44985-X_1","volume-title":"Algorithm Theory - SWAT 2000","author":"M. Thorup","year":"2000","unstructured":"Thorup, M., Karger, D.R.: Dynamic graph algorithms with applications. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 667\u2013673. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Vassilevska, V., Williams, R.: Finding, minimizing and counting weighted subgraphs. In: Proc. 41st ACM Symposium on Theory of Computing (2009)","key":"25_CR34","DOI":"10.1145\/1536414.1536477"},{"key":"25_CR35","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02294547","volume":"61","author":"S. Wasserman","year":"1996","unstructured":"Wasserman, S., Pattison, P.E.: Logit models and logistic regression for social networks, I: an introduction to Markov graphs and p*. Psychometrika\u00a061, 401\u2013425 (1996)","journal-title":"Psychometrika"},{"issue":"4","key":"25_CR36","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.ipl.2006.04.005","volume":"99","author":"R. Yuster","year":"2006","unstructured":"Yuster, R.: Finding and counting cliques and independent sets in r-uniform hypergraphs. Information Processing Letters\u00a099(4), 130\u2013134 (2006)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T17:12:05Z","timestamp":1633713125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}