{"id":"https://openalex.org/W3029680375","doi":"https://doi.org/10.1145/3375395.3387652","title":"Triangle and Four Cycle Counting in the Data Stream Model","display_name":"Triangle and Four Cycle Counting in the Data Stream Model","publication_year":2020,"publication_date":"2020-05-29","ids":{"openalex":"https://openalex.org/W3029680375","doi":"https://doi.org/10.1145/3375395.3387652","mag":"3029680375"},"language":"en","primary_location":{"id":"doi:10.1145/3375395.3387652","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3375395.3387652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101979548","display_name":"Andrew McGregor","orcid":"https://orcid.org/0000-0002-2124-160X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew McGregor","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041251603","display_name":"Sofya Vorotnikova","orcid":"https://orcid.org/0000-0002-3035-1122"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sofya Vorotnikova","raw_affiliation_strings":["Dartmouth College, Hanover, NH, USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101979548"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.6628,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.75327192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"445","last_page":"456"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.7287148833274841},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6517224907875061},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.581136167049408},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5498462319374084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5498408079147339},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.4238925576210022},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41218259930610657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40460094809532166}],"concepts":[{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.7287148833274841},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6517224907875061},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.581136167049408},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5498462319374084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5498408079147339},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.4238925576210022},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41218259930610657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40460094809532166}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3375395.3387652","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3375395.3387652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4889596686","display_name":null,"funder_award_id":"CCF-1934846, 1908849, 1907738, 1637536.","funder_id":"https://openalex.org/F4320315254","funder_display_name":"Innovative Research Group Project of the National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320315254","display_name":"Innovative Research Group Project of the National Natural Science Foundation of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1444168583","https://openalex.org/W1485437584","https://openalex.org/W1542957328","https://openalex.org/W1551652843","https://openalex.org/W1595640791","https://openalex.org/W1639030016","https://openalex.org/W1799685217","https://openalex.org/W1871809785","https://openalex.org/W1967022297","https://openalex.org/W1980223785","https://openalex.org/W1980389212","https://openalex.org/W1986745018","https://openalex.org/W1987996179","https://openalex.org/W1989966214","https://openalex.org/W1997010704","https://openalex.org/W1998272044","https://openalex.org/W2002205566","https://openalex.org/W2002576896","https://openalex.org/W2019982983","https://openalex.org/W2020022171","https://openalex.org/W2021016639","https://openalex.org/W2059867647","https://openalex.org/W2061342454","https://openalex.org/W2070161269","https://openalex.org/W2070486524","https://openalex.org/W2076448565","https://openalex.org/W2080745194","https://openalex.org/W2084170146","https://openalex.org/W2094308804","https://openalex.org/W2102322109","https://openalex.org/W2110814195","https://openalex.org/W2110942501","https://openalex.org/W2117071406","https://openalex.org/W2137778430","https://openalex.org/W2151078464","https://openalex.org/W2154191591","https://openalex.org/W2295466155","https://openalex.org/W2395422605","https://openalex.org/W2424986266","https://openalex.org/W2514575731","https://openalex.org/W2568847787","https://openalex.org/W2605016360","https://openalex.org/W2952849288","https://openalex.org/W2964156975","https://openalex.org/W4230053343"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2982430984","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W1989103179","https://openalex.org/W2117632582"],"abstract_inverted_index":{"The":[0,162,204,273],"problem":[1,87],"of":[2,6,13,28,43,46,88,109,115,122,144,192,195,256],"estimating":[3],"the":[4,14,21,29,34,40,44,47,52,58,64,75,86,99,107,113,120,125,128,142,157,193,254],"number":[5,108,114,121,143,194,255],"cycles":[7,306],"in":[8,20,38,49,56,69,93,124,156,226,232],"a":[9,137,166,190,208,227,249,263,277,293],"graph":[10,18,48,126],"is":[11,106,112,119,154,230],"one":[12],"most":[15],"widely":[16],"studied":[17],"problems":[19],"data":[22,30],"stream":[23,31,41],"model.":[24],"Three":[25],"relevant":[26],"variants":[27],"model":[32,37,55,68],"include:":[33],"arbitrary":[35,50],"order":[36,54,67],"which":[39,57,70],"consists":[42],"edges":[45,59,72,116],"order,":[51],"random":[53],"are":[60],"randomly":[61],"permuted,":[62],"and":[63,90,117,150,176,200,238,262,287,297,307],"adjacency":[65],"list":[66],"all":[71],"incident":[73],"to":[74],"same":[76],"vertex":[77],"appear":[78],"consecutively.":[79],"In":[80],"this":[81,153],"paper,":[82],"we":[83],"focus":[84],"on":[85],"triangle":[89],"four-cycle":[91],"counting":[92],"these":[94],"models.":[95],"We":[96,135,184,221,247,290],"improve":[97],"over":[98],"state-of-the-art":[100],"results":[101],"as":[102],"follows,":[103],"where":[104],"n":[105],"vertices,":[110],"m":[111],"T":[118,159],"triangles/four-cycles":[123],"(i.e.,":[127],"quantity":[129],"being":[130],"estimated):":[131],"Random":[132],"Order":[133,245],"Model:":[134,183,246],"present":[136,185,248],"single-pass":[138],"algorithm":[139,187,251,265,299],"that":[140,152,188,224,252,266],"(1+\u03b5)-approximates":[141,253],"triangles":[145],"using":[146,168,197,211,258,279],"~O(\u03b5-2":[147,259,268,280],"m/\u221aT)":[148,170,202],"space":[149,235,241,261,270],"prove":[151],"optimal":[155],"range":[158],"\u2264":[160],"\u221am.":[161],"best":[163,205,274],"previous":[164,206],"result,":[165,207,276],"(3+\u03b5)-approximation":[167],"~O(\u03b5-4.5":[169],"space,":[171,213,282],"was":[172,214,283],"presented":[173,215,284],"by":[174,216,285],"Cormode":[175],"Jowhari~(Theor.":[177],"Comput.":[178],"Sci.":[179],"2017).":[180],"Adjacency":[181],"List":[182],"an":[186],"returns":[189],"(1+\u03b5)-approximation":[191,225,278],"4-cycles":[196,257],"two":[198],"passes":[199],"~O(\u03b5-4":[201],"space.":[203],"constant":[209],"approximation":[210],"~O(m/T3/8)":[212],"Kallaugher":[217],"et":[218],"al.":[219],"(PODS~2019).":[220],"also":[222,291],"show":[223,292],"single":[228],"pass":[229],"possible":[231],"a)":[233],"polylog(n)":[234],"if":[236,242],"T=\u03a9(n2)":[237],"b)":[239],"~O(n)":[240],"T=\u03a9(n).":[243],"Arbitrary":[244],"three-pass":[250],"m/T1/4)":[260],"one-pass":[264],"uses":[267],"n)":[269],"when":[271],"T=\u03a9(n2).":[272],"existing":[275],"m2/T)":[281],"Bera":[286],"Chakrabarti":[288],"(STACS~2017).":[289],"multi-pass":[294],"lower":[295],"bound":[296],"another":[298],"for":[300],"distinguishing":[301],"graphs":[302,308],"with":[303,309],"no":[304],"four":[305],"many":[310],"4-cycles.":[311]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}