The h-index of a graph and its application to dynamic subgraph statistics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5664 LNCS, Issue , 2009, Pages 278-289

  Eppstein, David ^a   Spiro, Emma S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; EXPONENTIAL RANDOM GRAPH MODEL; INSERTIONS AND DELETIONS; NUMBER OF TRIANGLES; POWER LAW DEGREE DISTRIBUTION; REAL-WORLD NETWORKS; SOCIAL NETWORK ANALYSIS; SUBGRAPHS; UNDIRECTED GRAPH;

DATA STRUCTURES; ELECTRIC NETWORK ANALYSIS;

GRAPH THEORY;

EID: 69949179621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03367-4_25     Document Type: Conference Paper

References (36)

1. 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)
2. Albert, R., Jeong, H., Barabasi, A.-L.: The diameter of the world wide web. Nature 401, 130-131 (1999)
3. Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209-223 (1997)
4. Batagelj, V., Mrvar, A.: Pajek datasets (2006), http://vlado.fmf.uni-lj. si/pub/networks/data/
5. Borgatti, S.P., Everett, M.G., Freeman, L.C.: UCINet 6 for Windows: Software for social network analysis. Analytic Technologies, Harvard, MA (2002)
6. Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210-223 (1985)
7. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251-280 (1990)
8. DuBois, C.L., Smyth, P.: UCI Network Data Repository (2008), http://networkdata.ics.uci.edu
9. Duke, R.A., Lefmann, H., Rödl, V.: A fast approximation algorithm for computing the frequencies of subgraphs in a given graph. SIAM J. Comput. 24(3), 598-620 (1995)
10. Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science 326(1-3), 57-67 (2004)
11. Eppstein, D.: Connectivity, graph minors, and subgraph multiplicity. Journal of Graph Theory 17, 409-416 (1993)
12. Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Information Processing Letters 51(4), 207-211 (1994)
13. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms & Applications 3(3), 1-27 (1999)
14. Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275-291 (2000)
15. Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Atallah, M.J. (ed.) Algorithms and Theory of Computation Handbook, ch. 8, CRC Press, Boca Raton (1999)
16. Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. Electronic preprint arxiv:0904.3741 (2009)
17. Feigenbaum, J., Kannan, S.: Dynamic graph algorithms. In: Rosen, K. (ed.) Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)
18. Frank, O.: Statistical analysis of change in networks. Statistica Neerlandica 45, 283-293 (1999)
19. Frank, O., Strauss, D.: Markov graphs. J. Amer. Statistical Assoc. 81, 832-842 (1986)
20. 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
21. Hirsch, J.E.: An index to quantify an individual's scientific research output. Proc. National Academy of Sciences 102(46), 16569-16572 (2005)
22. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413-423 (1978)
23. Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746-1758 (2004)
24. Kloks, T., Kratsch, D., Müller, H.: Finding and counting small induced subgraphs efficiently. Information Processing Letters 74(3-4), 115-121 (2000)
25. Liljeros, F., Edling, C.R., Amaral, L.A.N., Stanley, H.E., Åberg, Y.: The web of human sexual contacts. Nature 411, 907-908 (2001)
26. Nešetřil, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26(2), 415-419 (1985)
27. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167-256 (2003)
28. desolla Price, D.J.: Networks of scientific papers. Science 149 (3683), 510-515 (1965)
29. Pržulj, N., Corneil, D.G., Jurisica, I.: Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinformatics 22(8), 974-980 (2006)
30. *) models. Social Networks 29(2), 169-172 (2007); Special issue of journal with four additional articles
31. Snijders, T.A.B.: Markov chain Monte Carlo estimation of exponential random graph models. Journal of Social Structure 3(2), 1-40 (2002)
32. Snijders, T.A.B., Pattison, P.E., Robins, G., Handcock, M.S.: New specifications for exponential random graph models. Sociological Methodology 36(1), 99-153 (2006)
33. Thorup, M., Karger, D.R.: Dynamic graph algorithms with applications. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 667-673. Springer, Heidelberg (2000)
34. Vassilevska, V., Williams, R.: Finding, minimizing and counting weighted subgraphs. In: Proc. 41st ACM Symposium on Theory of Computing (2009)
35. *. Psychometrika 61, 401-425 (1996)
36. Yuster, R.: Finding and counting cliques and independent sets in r-uniform hypergraphs. Information Processing Letters 99(4), 130-134 (2006)