{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:42:04Z","timestamp":1726029724536},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030144586"},{"type":"electronic","value":"9783030144593"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14459-3_3","type":"book-chapter","created":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T15:21:41Z","timestamp":1551799301000},"page":"33-45","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Approach for Counting Occurring Induced Subgraphs"],"prefix":"10.1007","author":[{"given":"Luciano","family":"Gr\u00e1cio","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Apar\u00edcio, D.O., Ribeiro, P.M.P., da Silva, F.M.A.: Parallel subgraph counting for multicore architectures. In: 2014 IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA), pp. 34\u201341. IEEE, Piscataway (2014)","key":"3_CR1","DOI":"10.1109\/ISPA.2014.14"},{"doi-asserted-by":"crossref","unstructured":"Costa, L.d.F., Oliveira Jr, O.N., Travieso, G., Rodrigues, F.A., Villas Boas, P.R., Antiqueira, L., Viana, M.P., Correa Rocha, L.E.: Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv. Phys. 60(3), 329\u2013412 (2011)","key":"3_CR2","DOI":"10.1080\/00018732.2011.572452"},{"doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. In: Graph Algorithms and Applications I, pp. 283\u2013309. World Scientific, Singapore (2002)","key":"3_CR3","DOI":"10.1142\/9789812777638_0014"},{"issue":"3","key":"3_CR4","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1137\/100783066","volume":"25","author":"M Gonen","year":"2011","unstructured":"Gonen, M., Ron, D., Shavitt, Y.: Counting stars and other small subgraphs in sublinear-time. SIAM J. Discret. Math. 25(3), 1365\u20131411 (2011)","journal-title":"SIAM J. Discret. Math."},{"doi-asserted-by":"crossref","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Annual International Conference on Research in Computational Molecular Biology, pp. 92\u2013106. Springer, Berlin (2007)","key":"3_CR5","DOI":"10.1007\/978-3-540-71681-5_7"},{"issue":"4","key":"3_CR6","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar, T., Dem\u0161ar, J.: A combinatorial approach to graphlet counting. Bioinformatics 30(4), 559\u2013565 (2014)","journal-title":"Bioinformatics"},{"issue":"5","key":"3_CR7","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0097896","volume":"9","author":"M Houbraken","year":"2014","unstructured":"Houbraken, M., Demeyer, S., Michoel, T., Audenaert, P., Colle, D., Pickavet, M.: The index-based subgraph matching algorithm with general symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration. PLoS One 9(5), e97896 (2014)","journal-title":"PLoS One"},{"issue":"1","key":"3_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang, C., Coenen, F., Zito, M.: A survey of frequent subgraph mining algorithms. Knowl. Eng. Rev. 28(1), 75\u2013105 (2013)","journal-title":"Knowl. Eng. Rev."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"II. J. Symb. Comput."},{"issue":"5594","key":"3_CR10","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Paredes, P., Ribeiro, P.: Towards a faster network-centric subgraph census. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 264\u2013271. ACM, New York (2013)","key":"3_CR11","DOI":"10.1145\/2492517.2492535"},{"issue":"1","key":"3_CR12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s13278-015-0256-2","volume":"5","author":"P Paredes","year":"2015","unstructured":"Paredes, P., Ribeiro, P.: Rand-fase: fast approximate subgraph census. Soc. Netw. Anal. Min. 5(1), 17 (2015)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"2","key":"3_CR13","doi-asserted-by":"crossref","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177\u2013e183 (2007)","journal-title":"Bioinformatics"},{"issue":"2","key":"3_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","volume":"28","author":"P Ribeiro","year":"2014","unstructured":"Ribeiro, P., Silva, F.: G-tries: a data structure for storing and finding subgraphs. Data Min. Knowl. Disc. 28(2), 337\u2013377 (2014)","journal-title":"Data Min. Knowl. Disc."},{"doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F., Lopes, L.: Efficient parallel subgraph counting using g-tries. In: 2010 IEEE International Conference on Cluster Computing, pp. 217\u2013226. IEEE, Piscataway (2010)","key":"3_CR15","DOI":"10.1109\/CLUSTER.2010.27"},{"doi-asserted-by":"crossref","unstructured":"Schreiber, F., Schw\u00f6bbermeyer, H.: Frequency concepts and pattern detection for the analysis of motifs in networks. In: Transactions on Computational Systems Biology III, pp. 89\u2013104. Springer, Berlin (2005)","key":"3_CR16","DOI":"10.1007\/11599128_7"},{"issue":"3","key":"3_CR17","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1140\/epjb\/e2011-10979-2","volume":"81","author":"L \u0160ubelj","year":"2011","unstructured":"\u0160ubelj, L., Bajec, M.: Robust network community detection using balanced propagation. Eur. Phys. J. B 81(3), 353\u2013362 (2011)","journal-title":"Eur. Phys. J. B"},{"issue":"1","key":"3_CR18","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TKDE.2017.2756836","volume":"30","author":"P Wang","year":"2018","unstructured":"Wang, P., Zhao, J., Zhang, X., Li, Z., Cheng, J., Lui, J.C., Towsley, D., Tao, J., Guan, X.: Moss-5: A fast method of approximating counts of 5-node graphlets in large graphs. IEEE Trans. Knowl. Data Eng. 30(1), 73\u201386 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"3_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S.: Efficient detection of network motifs. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"4","key":"3_CR20","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."}],"container-title":["Springer Proceedings in Complexity","Complex Networks X"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14459-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T08:17:20Z","timestamp":1558426640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-14459-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030144586","9783030144593"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14459-3_3","relation":{},"ISSN":["2213-8684","2213-8692"],"issn-type":[{"type":"print","value":"2213-8684"},{"type":"electronic","value":"2213-8692"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CompleNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Complex Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tarragona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"complenet2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/complenet.weebly.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}