{"id":"https://openalex.org/W7118692420","doi":"https://doi.org/10.1137/1.9781611978971.158","title":"Near-Optimal Four-Cycle Counting in Graph Streams","display_name":"Near-Optimal Four-Cycle Counting in Graph Streams","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118692420","doi":"https://doi.org/10.1137/1.9781611978971.158"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.158","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.158","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"conference-paper","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/A5122137647","display_name":"Sebastian L\u00fcderssen","orcid":null},"institutions":[{"id":"https://openalex.org/I2800873102","display_name":"FWF Austrian Science Fund","ror":"https://ror.org/013tf3c58","country_code":"AT","type":"nonprofit","lineage":["https://openalex.org/I2800873102"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sebastian L\u00fcderssen","raw_affiliation_strings":["TU Wien, Vienna, Austria. This research has been funded by the Vienna Science and Technology Fund (WWTF) [Grant ID: 10.47379/VRG23013]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria. This research has been funded by the Vienna Science and Technology Fund (WWTF) [Grant ID: 10.47379/VRG23013]","institution_ids":["https://openalex.org/I2800873102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008120721","display_name":"Stefan Neumann","orcid":"https://orcid.org/0000-0002-3981-1500"},"institutions":[{"id":"https://openalex.org/I2800873102","display_name":"FWF Austrian Science Fund","ror":"https://ror.org/013tf3c58","country_code":"AT","type":"nonprofit","lineage":["https://openalex.org/I2800873102"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Neumann","raw_affiliation_strings":["TU Wien, Vienna, Austria. This research has been funded by the Vienna Science and Technology Fund (WWTF) [Grant ID: 10.47379/VRG23013]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria. This research has been funded by the Vienna Science and Technology Fund (WWTF) [Grant ID: 10.47379/VRG23013]","institution_ids":["https://openalex.org/I2800873102"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101668134","display_name":"Pan Peng","orcid":"https://orcid.org/0000-0003-2700-5699"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4390039265","display_name":"PRG S&Tech (South Korea)","ror":"https://ror.org/02sr2ee22","country_code":null,"type":"company","lineage":["https://openalex.org/I4390039265"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pan Peng","raw_affiliation_strings":["School of Computer Science and Technology","University of Science and Technology of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology","institution_ids":["https://openalex.org/I4390039265"]},{"raw_affiliation_string":"University of Science and Technology of China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4285","last_page":"4326"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.18140000104904175,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.18140000104904175,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.11949999630451202,"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/T11269","display_name":"Algorithms and Data Compression","score":0.061799999326467514,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.536899983882904},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5340999960899353},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.32109999656677246},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.305400013923645},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.2883000075817108}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6116999983787537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.58160001039505},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.536899983882904},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5340999960899353},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46720001101493835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4099999964237213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3504999876022339},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.26739999651908875},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.158","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.158","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,9],"study":[1],"four-cycle":[2],"counting":[3],"in":[4,40],"arbitrary":[5],"order":[6],"graph":[7],"streams.":[8],"present":[10],"a":[11,46,57],"3-pass":[12,47],"algorithm":[13,48],"for":[14],"\\((1":[15],"+":[16],"\\varepsilon)\\)-approximating":[17],"the":[18,30,36,41],"number":[19,31,37],"of":[20,32,38,61],"four-cycles":[21,39],"using":[22,51],"\\(\\tilde":[23,53],"O(m/\\sqrt":[24],"T)\\)":[25,63],"space,":[26],"where":[27],"\\(m\\)":[28],"is":[29],"edges":[33],"and":[34,55,66],"\\(T\\)":[35],"graph.":[42],"This":[43],"improves":[44],"upon":[45],"by":[49,64],"Vorotnikova":[50],"space":[52],"O(m/T^{1/3})\\)":[54],"matches":[56],"multi-pass":[58],"lower":[59],"bound":[60],"\\(\\Omega(m/\\sqrt":[62],"McGregor":[65],"Vorotnikova.":[67]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-08T00:00:00"}