Skip to main content
SpringerLink
Log in

Counting Subgraphs in Relational Event Graphs

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2016)

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

Included in the following conference series:

Abstract

Analysis of the structural properties of social networks has gained much interest nowadays due to its diverse range of applications. When communications between entities (i.e., edges) of a social network (graph) are stamped with time, we want to analyze all subgraphs within an arbitrary query time slice so that the number of a specific subgraph can be counted and reported quickly. We present data structures to answer such queries for triangles, quadrangles, complete subgraphs, and maximal complete subgraphs.

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 EPUB and 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

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Bannister, M.J., DuBois, C., Eppstein, D., Smyth, P.: Windows into relational event: data structures for contiguous subsequences of edges. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2013)

    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. de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. Algorithms and Applications, 3rd edn. Springer, New York (1998)

    MATH  Google Scholar 

  5. Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326(1–3), 57–67 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1–27 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51, 207–211 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  10. Harary, F.: Graph Theory, revised, Addision-Wesley Publishing Company, Reading (1969)

    Google Scholar 

  11. Harary, F., Kommel, H.J.: Matrix measures for transitivity and balance. J. Math. Sociol. 6, 199–210 (1979)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. JáJá, J., Mortensen, C.W., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 558–568. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Kloks, T., Kratsch, D., Muller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3–4), 115–121 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Opsahl, T.: Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc. Netw. 35(2), 159–167 (2013)

    Article  Google Scholar 

  16. Nešetřil, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26(2), 415–419 (1985)

    MathSciNet  MATH  Google Scholar 

  17. Newman, M.E.: Detecting community structure in networks. Eur. Phys. J. B-Condensed Matter Complex Syst. 38(2), 321–330 (2004)

    Article  Google Scholar 

  18. Papadimitriou, C., Yannakakis, M.: The clique problem for planar graphs. Inf. Process. Lett. 13, 131–133 (1981)

    Article  MathSciNet  Google Scholar 

  19. Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM (JACM) 23(1), 31–42 (1976)

    Article  MathSciNet  Google Scholar 

  20. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410–421 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  21. Watts, D.J., Strogatz, S.H.: Collective dynamics of “smallworld” networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  22. Zhang, P., Wang, J., Li, X., Li, M., Di, Z., Fan, Y.: Clustering coefficient and community structure of bipartite networks. Phys. A 387(27), 6869–6875 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Ottawa, ON, K1S 5B6, Canada

    Farah Chanchary & Anil Maheshwari

Authors
  1. Farah Chanchary
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anil Maheshwari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Farah Chanchary .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engin., Bangladesh Univ. of Engin. & Technol., Dhaka, Bangladesh

    Mohammad Kaykobad

  2. Dept. of Computer Science, Sapienza University of Rome, Rome, Italy

    Rossella Petreschi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Chanchary, F., Maheshwari, A. (2016). Counting Subgraphs in Relational Event Graphs. In: Kaykobad, M., Petreschi, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2016. Lecture Notes in Computer Science(), vol 9627. Springer, Cham. https://doi.org/10.1007/978-3-319-30139-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30139-6_16

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30138-9

  • Online ISBN: 978-3-319-30139-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation