{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T15:22:01Z","timestamp":1726068121871},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030409425"},{"type":"electronic","value":"9783030409432"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40943-2_1","type":"book-chapter","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T17:03:32Z","timestamp":1582304612000},"page":"3-15","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Condensed Graphs: A Generic Framework for Accelerating Subgraph Census Computation"],"prefix":"10.1007","author":[{"given":"Miguel","family":"Martins","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.: Efficient graphlet counting for large networks. In: International Conference on Data Mining, pp. 1\u201310. IEEE (2015)","DOI":"10.1109\/ICDM.2015.141"},{"issue":"5439","key":"1_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.tcs.2008.10.015","volume":"410","author":"Y Gao","year":"2009","unstructured":"Gao, Y.: The degree distribution of random k-trees. Theor. Comput. Sci. 410, 688\u2013695 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR5","unstructured":"Hagberg, A., Schult, D., Swart, P., Conway, D., S\u00e9guin-Charbonneau, L., Ellison, C., Edwards, B., Torrents, J.: NetworkX. High productivity software for complex networks. Webov\u00e1 str\u00e1 nka (2013). https:\/\/networkx.lanl.gov\/wiki"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","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":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"e0171428","DOI":"10.1371\/journal.pone.0171428","volume":"12","author":"T Ho\u010devar","year":"2017","unstructured":"Ho\u010devar, T., Dem\u0161ar, J.: Combinatorial algorithm for counting small induced graphs and orbits. PloS One 12(2), e0171428 (2017)","journal-title":"PloS One"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"026107","DOI":"10.1103\/PhysRevE.65.026107","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme, P., Kim, B.J.: Growing scale-free networks with tunable clustering. Phys. Rev. E 65(2), 026107 (2002)","journal-title":"Phys. Rev. E"},{"issue":"7","key":"1_CR9","doi-asserted-by":"publisher","first-page":"e68073","DOI":"10.1371\/journal.pone.0068073","volume":"8","author":"S Khakabimamaghani","year":"2013","unstructured":"Khakabimamaghani, S., Sharafuddin, I., Dichter, N., Koch, I., Masoudi-Nejad, A.: Quatexelero: an accelerated exact network motif detection algorithm. PloS One 8(7), e68073 (2013)","journal-title":"PloS One"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350. ACM (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"1_CR11","unstructured":"McKay, B.D.: Nauty user\u2019s guide (version 2.2). Technical report, TR-CS-9002, Australian National University (2003)"},{"issue":"5594","key":"1_CR12","doi-asserted-by":"publisher","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"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Paredes, P., Ribeiro, P.: Towards a faster network-centric subgraph census. In: International Conference on Advances in Social Networks Analysis and Mining, pp. 264\u2013271. IEEE (2013)","DOI":"10.1145\/2492517.2492535"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: ESCAPE: efficiently counting all 5-vertex subgraphs. In: International Conference on World Wide Web, pp. 1431\u20131440. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052597"},{"key":"1_CR15","doi-asserted-by":"publisher","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, e177\u2013e183 (2007)","journal-title":"Bioinformatics"},{"key":"1_CR16","unstructured":"Ribeiro, P., Paredes, P., Silva, M.E., Aparicio, D., Silva, F.: A survey on subgraph counting: concepts, algorithms and applications to network motifs and graphlets. arXiv preprint arXiv:1910.13011 (2019)"},{"key":"1_CR17","doi-asserted-by":"publisher","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. Discov. 28, 337\u2013377 (2014)","journal-title":"Data Min. Knowl. Discov."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","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."}],"container-title":["Springer Proceedings in Complexity","Complex Networks XI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40943-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T06:48:30Z","timestamp":1665902910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40943-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030409425","9783030409432"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40943-2_1","relation":{},"ISSN":["2213-8684","2213-8692"],"issn-type":[{"type":"print","value":"2213-8684"},{"type":"electronic","value":"2213-8692"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}