ResearchTrend.AI
Fast and Accurate Triangle Counting in Graph Streams Using Predictions

Fast and Accurate Triangle Counting in Graph Streams Using Predictions

Cristian Boldrin
Fabio Vandin
ArXiv (abs)PDFHTML

Papers citing "Fast and Accurate Triangle Counting in Graph Streams Using Predictions"

4 / 4 papers shown
Title
Fast and Simple Densest Subgraph with Predictions
Fast and Simple Densest Subgraph with Predictions
Thai Bui
Hoa T. Vu
GNN
48
0
0
19 May 2025
Triangle and Four Cycle Counting with Predictions in Graph Streams
Triangle and Four Cycle Counting with Predictions in Graph Streams
Justin Y. Chen
T. Eden
Piotr Indyk
Honghao Lin
Shyam Narayanan
R. Rubinfeld
Sandeep Silwal
Tal Wagner
David P. Woodruff
Michael Zhang
124
23
0
17 Mar 2022
A Model for Learned Bloom Filters, and Optimizing by Sandwiching
A Model for Learned Bloom Filters, and Optimizing by Sandwiching
Michael Mitzenmacher
59
185
0
03 Jan 2019
Learning Combinatorial Optimization Algorithms over Graphs
Learning Combinatorial Optimization Algorithms over Graphs
H. Dai
Elias Boutros Khalil
Yuyu Zhang
B. Dilkina
Le Song
114
1,472
0
05 Apr 2017

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.