{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:04:14Z","timestamp":1743102254472,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319301389"},{"type":"electronic","value":"9783319301396"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30139-6_16","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T08:35:02Z","timestamp":1455870902000},"page":"194-206","source":"Crossref","is-referenced-by-count":3,"title":["Counting Subgraphs in Relational Event Graphs"],"prefix":"10.1007","author":[{"given":"Farah","family":"Chanchary","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","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 17(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1137\/1.9781611973105.61"},{"issue":"1","key":"16_CR3","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. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"16_CR4","series-title":"Algorithms and Applications","volume-title":"Computational Geometry","author":"M Berg de","year":"1998","unstructured":"de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. Algorithms and Applications, 3rd edn. Springer, New York (1998)","edition":"3"},{"issue":"1\u20133","key":"16_CR5","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. Theoret. Comput. Sci. 326(1\u20133), 57\u201367 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"16_CR6","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. J. Graph Algorithms Appl. 3(3), 1\u201327 (1999)","journal-title":"J. Graph Algorithms Appl."},{"key":"16_CR7","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 27, 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"16_CR8","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. Inf. Process. Lett. 51, 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory, revised, Addision-Wesley Publishing Company, Reading (1969)","DOI":"10.21236\/AD0705364"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1080\/0022250X.1979.9989889","volume":"6","author":"F Harary","year":"1979","unstructured":"Harary, F., Kommel, H.J.: Matrix measures for transitivity and balance. J. Math. Sociol. 6, 199\u2013210 (1979)","journal-title":"J. Math. Sociol."},{"issue":"4","key":"16_CR12","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. 7(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-30551-4_49","volume-title":"Algorithms and Computation","author":"J J\u00e1J\u00e1","year":"2004","unstructured":"J\u00e1J\u00e1, 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\u2013568. Springer, Heidelberg (2004)"},{"issue":"3\u20134","key":"16_CR14","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., Muller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3\u20134), 115\u2013121 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl, T.: Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc. Netw. 35(2), 159\u2013167 (2013)","journal-title":"Soc. Netw."},{"issue":"2","key":"16_CR16","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 26(2), 415\u2013419 (1985)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Detecting community structure in networks. Eur. Phys. J. B-Condensed Matter Complex Syst. 38(2), 321\u2013330 (2004)","journal-title":"Eur. Phys. J. B-Condensed Matter Complex Syst."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"C Papadimitriou","year":"1981","unstructured":"Papadimitriou, C., Yannakakis, M.: The clique problem for planar graphs. Inf. Process. Lett. 13, 131\u2013133 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM (JACM) 23(1), 31\u201342 (1976)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u201csmallworld\u201d networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"27","key":"16_CR22","doi-asserted-by":"publisher","first-page":"6869","DOI":"10.1016\/j.physa.2008.09.006","volume":"387","author":"P Zhang","year":"2008","unstructured":"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\u20136875 (2008)","journal-title":"Phys. A"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30139-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T15:37:31Z","timestamp":1567611451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30139-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319301389","9783319301396"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30139-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}