{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:42:07Z","timestamp":1792071727831,"version":"4.4.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":54,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,3]]},"DOI":"10.1145\/3038912.3052597","type":"proceedings-article","created":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T09:30:38Z","timestamp":1491471038000},"page":"1431-1440","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":115,"title":["ESCAPE"],"prefix":"10.1145","author":[{"given":"Ali","family":"Pinar","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vaidyanathan","family":"Vishal","sequence":"additional","affiliation":[{"name":"Onu Technology, Cupertino, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Escape. https:\/\/bitbucket.org\/seshadhri\/escape."},{"key":"e_1_3_2_1_2_1","unstructured":"Parallel parameterized graphlet decomposition (pgd) library. http:\/\/nesreenahmed.com\/graphlets\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195179"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.19"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.87"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/12-EJS698"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1086\/421787"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1086\/228943"},{"key":"e_1_3_2_1_15_1","volume-title":"Graduate texts in mathematics 173","author":"Diestel R.","year":"2006","unstructured":"R. Diestel. Graph Theory, Graduate texts in mathematics 173. Springer-Verlag, 2006."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783413"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883082"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10390645"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.3934\/nhm.2008.3.239"},{"key":"e_1_3_2_1_22_1","volume-title":"Bioinformatics","author":"Hocevar T.","year":"2014","unstructured":"T. Hocevar and J. Demsar. A combinatorial approach to graphlet counting. Bioinformatics, 2014."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1086\/224954"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0030118"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2010.41"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0147078"},{"key":"e_1_3_2_1_29_1","volume-title":"Jan.","author":"Milenkovic T.","year":"2008","unstructured":"T. Milenkovic and N. Przulj. Uncovering Biological Network Function via Graphlet Degree Signatures. arXiv, q-bio.MN, Jan. 2008."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_31_1","volume-title":"Escape:efficiently counting all 5-vertex subgraphs. Technical report","author":"Pinar A.","year":"2016","unstructured":"A. Pinar, C. Seshadhri, and V. Vishal. Escape:efficiently counting all 5-vertex subgraphs. Technical report, 2016. https:\/\/users.soe.ucsc.edu\/ sesh\/escape.pdf."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.24.1.1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00108"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056109"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the SIAM Conference on Data Mining","author":"Seshadhri C.","year":"2013","unstructured":"C. Seshadhri, A. Pinar, and T. G. Kolda. Fast triangle counting through wedge sampling. In Proceedings of the SIAM Conference on Data Mining, 2013."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1004008107"},{"key":"e_1_3_2_1_42_1","volume-title":"Combinatorial algorithm for counting small induced graphs and orbits. Technical report, arXiv","author":"Tomaz Hocevar J. D.","year":"2016","unstructured":"J. D. Tomaz Hocevar. Combinatorial algorithm for counting small induced graphs and orbits. Technical report, arXiv, 2016. http:\/\/arxiv.org\/abs\/1601.06834."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00245"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488502"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl038"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbr033"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.44"},{"key":"e_1_3_2_1_53_1","unstructured":"The network repository. Available at http:\/\/www.networkrepository.com\/."},{"key":"e_1_3_2_1_54_1","unstructured":"Stanford Network Analysis Project (SNAP). Available at http:\/\/snap.stanford.edu\/."}],"event":{"name":"WWW '17: 26th International World Wide Web Conference","location":"Perth Australia","acronym":"WWW '17","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 26th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3038912.3052597","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3038912.3052597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:24:06Z","timestamp":1750206246000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3038912.3052597"}},"subtitle":["Efficiently Counting All 5-Vertex Subgraphs"],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":54,"alternative-id":["10.1145\/3038912.3052597","10.5555\/3038912"],"URL":"https:\/\/doi.org\/10.1145\/3038912.3052597","relation":{},"subject":[],"published":{"date-parts":[[2017,4,3]]},"assertion":[{"value":"2017-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}