{"id":"https://openalex.org/W2996939161","doi":"https://doi.org/10.1145/3336191.3371773","title":"Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE","display_name":"Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE","publication_year":2020,"publication_date":"2020-01-20","ids":{"openalex":"https://openalex.org/W2996939161","doi":"https://doi.org/10.1145/3336191.3371773","mag":"2996939161"},"language":"en","primary_location":{"id":"doi:10.1145/3336191.3371773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3336191.3371773","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3336191.3371773","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3336191.3371773","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073010826","display_name":"Noujan Pashanasangi","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Noujan Pashanasangi","raw_affiliation_strings":["University of California, Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038687804","display_name":"C. Seshadhri","orcid":"https://orcid.org/0000-0003-2163-3555"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Seshadhri","raw_affiliation_strings":["University of California, Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073010826"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":2.1319,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.86922393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"447","last_page":"455"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9832000136375427,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.795333981513977},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6221174597740173},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.586280882358551},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5356414318084717},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5069823265075684},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4801853895187378},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4576517641544342},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3817409574985504},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3603855073451996},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2621768116950989},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07822635769844055}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.795333981513977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6221174597740173},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.586280882358551},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5356414318084717},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5069823265075684},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4801853895187378},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4576517641544342},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3817409574985504},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3603855073451996},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2621768116950989},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07822635769844055},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3336191.3371773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3336191.3371773","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3336191.3371773","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th International Conference on Web Search and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3336191.3371773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3336191.3371773","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3336191.3371773","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4000000059604645}],"awards":[{"id":"https://openalex.org/G1912567690","display_name":null,"funder_award_id":"1813165","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2305740495","display_name":null,"funder_award_id":"CCF-1813165","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2854562603","display_name":null,"funder_award_id":"CCF-1740850","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3386630877","display_name":null,"funder_award_id":"W911NF1910294","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G3667867886","display_name":"TRIPODS: Towards a Unified Theory of Structure, Incompleteness & Uncertainty in Heterogeneous Graphs","funder_award_id":"1740850","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7356824591","display_name":null,"funder_award_id":"CCF-1740850, CCF-1813165","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7452299184","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G8998121839","display_name":null,"funder_award_id":"911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G965573633","display_name":null,"funder_award_id":"W911NF1910","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2996939161.pdf","grobid_xml":"https://content.openalex.org/works/W2996939161.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W158117962","https://openalex.org/W1512140523","https://openalex.org/W1576857282","https://openalex.org/W1888346910","https://openalex.org/W1967022297","https://openalex.org/W1974332999","https://openalex.org/W1999079690","https://openalex.org/W2002779084","https://openalex.org/W2022322548","https://openalex.org/W2052262538","https://openalex.org/W2055245094","https://openalex.org/W2060038721","https://openalex.org/W2074724691","https://openalex.org/W2085491458","https://openalex.org/W2101157403","https://openalex.org/W2102322109","https://openalex.org/W2104812688","https://openalex.org/W2115059495","https://openalex.org/W2143744498","https://openalex.org/W2148762636","https://openalex.org/W2159156271","https://openalex.org/W2230994892","https://openalex.org/W2241571695","https://openalex.org/W2256826326","https://openalex.org/W2266714125","https://openalex.org/W2294347342","https://openalex.org/W2345862122","https://openalex.org/W2470861207","https://openalex.org/W2503647350","https://openalex.org/W2543598748","https://openalex.org/W2593237279","https://openalex.org/W2605850919","https://openalex.org/W2626275337","https://openalex.org/W2755088640","https://openalex.org/W2759633270","https://openalex.org/W2770482399","https://openalex.org/W2793994977","https://openalex.org/W2907825062","https://openalex.org/W2962752269","https://openalex.org/W2963001918","https://openalex.org/W2964198126","https://openalex.org/W2989816811","https://openalex.org/W2996939161","https://openalex.org/W3029825151","https://openalex.org/W3105186473","https://openalex.org/W3123534837","https://openalex.org/W4232896595"],"related_works":["https://openalex.org/W2951429970","https://openalex.org/W2145212918","https://openalex.org/W4387914616","https://openalex.org/W2351427475","https://openalex.org/W2004969038","https://openalex.org/W2077115523","https://openalex.org/W2100121598","https://openalex.org/W1574297037","https://openalex.org/W2386691237","https://openalex.org/W2227578245"],"abstract_inverted_index":{"Subgraph":[0],"counting":[1],"is":[2,12,89],"a":[3,25,30,67],"fundamental":[4],"task":[5],"in":[6,29,77],"network":[7],"analysis.":[8],"Typically,":[9],"algorithmic":[10],"work":[11],"on":[13],"total":[14,22,98],"counting,":[15],"where":[16],"we":[17],"wish":[18],"to":[19,123],"count":[20,58],"the":[21,52,57,60,93,116],"frequency":[23],"of":[24,51,59,70,96],"(small)":[26],"pattern":[27,61],"subgraph":[28,62],"large":[31],"input":[32,53],"data":[33],"set.":[34],"But":[35,85],"many":[36],"applications":[37],"require":[38,107],"local":[39,87],"counts":[40,88,99,106],"(also":[41],"called":[42],"vertex":[43,49,71],"orbit":[44],"counts)":[45],"wherein,":[46],"for":[47],"every":[48],"v":[50],"graph,":[54],"one":[55],"needs":[56],"involving":[63],"v.":[64],"This":[65],"provides":[66],"rich":[68],"set":[69],"features":[72],"that":[73,109],"can":[74],"be":[75],"used":[76],"machine":[78],"learning":[79],"tasks,":[80],"especially":[81],"classification":[82],"and":[83,115],"clustering.":[84],"getting":[86,97],"extremely":[90],"challenging.":[91],"Even":[92],"easier":[94],"problem":[95],"has":[100],"received":[101],"much":[102,111],"research":[103],"attention.":[104],"Local":[105],"algorithms":[108],"get":[110],"finer":[112],"grained":[113],"information,":[114],"sheer":[117],"output":[118],"size":[119],"makes":[120],"it":[121],"difficult":[122],"design":[124],"scalable":[125],"algorithms.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}