Skip to main content
SpringerLink
Log in

Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6508))

Abstract

We present techniques for maintaining subgraph frequencies in a dynamic graph, using data structures that are parameterized in terms of h, the h-index of the graph. Our methods extend previous results of Eppstein and Spiro for maintaining statistics for undirected subgraphs of size three to directed subgraphs and to subgraphs of size four. For the directed case, we provide a data structure to maintain counts for all 3-vertex induced subgraphs in O(h) amortized time per update. For the undirected case, we maintain the counts of size-four subgraphs in O(h 2) amortized time per update. These extensions enable a number of new applications in Bioinformatics and Social Networking research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Jeong, H., Barabasi, A.-L.: The diameter of the world wide web. Nature 401, 130–131 (1999)

    Article  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209–223 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1), 33–47 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness i: Basic results. SIAM J. Comput. 24(4), 873–921 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms & Applications 3(3), 1–27 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275–291 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Eppstein, D., Goodrich, M.T.: Studying (non-planar) road networks through an algorithmic lens. In: GIS 2008: Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 1–10. ACM, New York (2008)

    Google Scholar 

  10. Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 278–289. Springer, Heidelberg (2009)

    Google Scholar 

  11. Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. arXiv:0904.3741 (2009)

    Google Scholar 

  12. Frank, O.: Statistical analysis of change in networks. Statistica Neerlandica 45, 283–293 (1991)

    Google Scholar 

  13. Frank, O., Strauss, D.: Markov graphs. J. Amer. Statistical Assoc. 81, 832–842 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hirsch, J.E.: An index to quantify an individual’s scientific research output. Proc. National Academy of Sciences 102(46), 16569–16572 (2005)

    Article  MATH  Google Scholar 

  15. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413–423 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  16. Milenković, T., Pržulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Informatics 6, 257–273 (2008)

    Google Scholar 

  17. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2), 63–77 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Price, D.J.d.S.: Networks of scientific papers. Science 149(3683), 510–515 (1965)

    Article  Google Scholar 

  20. Pržulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177–e183 (2007)

    Article  Google Scholar 

  21. 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)

    Article  Google Scholar 

  22. Snijders, T.A.B.: Markov chain Monte Carlo estimation of exponential random graph models. Journal of Social Structure 3(2), 1–40 (2002)

    Google Scholar 

  23. 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)

    Article  Google Scholar 

  24. Wasserman, S., Pattison, P.E.: Logit models and logistic regression for social networks, I: an introduction to Markov graphs and p *. Psychometrika 61, 401–425 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of California, Irvine, USA

    David Eppstein, Michael T. Goodrich, Darren Strash & Lowell Trott

Authors
  1. David Eppstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Darren Strash
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lowell Trott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Weili Wu  & Ovidiu Daescu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eppstein, D., Goodrich, M.T., Strash, D., Trott, L. (2010). Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17458-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17457-5

  • Online ISBN: 978-3-642-17458-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation