Record link: 
http://hdl.handle.net/20.500.12708/230129
-
Title: 
Near-Optimal Four-Cycle Counting in Graph Streams
en
Citation: 
Lüderssen, S. J., Neumann, S., & Peng, P. (2026). Near-Optimal Four-Cycle Counting in Graph Streams. In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 4285–4326). https://doi.org/10.1137/1.9781611978971.158
-
Publisher DOI: 
10.1137/1.9781611978971.158
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Lüderssen, Sebastian Johannes 
Neumann, Stefan 
Peng, Pan 
-
Organisational Unit: 
E194-06 - Forschungsbereich Machine Learning 
E056-23 - Fachbereich Innovative Combinations and Applications of AI and ML (iCAIML) 
-
Published in: 
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 
-
ISBN: 
978-1-61197-897-1
-
DOI of the book: 
10.1137/1.9781611978971
-
Date (published): 
2026
-
Event name: 
ACM-SIAM Symposium on Discrete Algorithms (SODA 2026) 
en
Event date: 
11-Jan-2026 - 14-Jan-2026
-
Event place: 
Vancouver, Canada
-
Number of Pages: 
42
-
Peer reviewed: 
Yes
-
Keywords: 
algorithms; streaming; subgraph counting
en
Project title: 
Towards Trustworthy Recommendation Systems for Online Social Networks: VRG23-013 (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds) 
-
Research Areas: 
Mathematical and Algorithmic Foundations: 100%
-
Science Branch: 
1020 - Informatik: 90%
5020 - Wirtschaftswissenschaften: 10%
-
Appears in Collections:
Conference Paper

Show full item record

Google ScholarTM

Check