Copertina

Fast and Accurate Triangle Counting in Graph Streams Using Predictions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Boldrin, Cristian, Vandin, Fabio
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
di: Venturin, Giorgio, et al.
Pubblicazione: (2025)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
di: Xuan, Wei, et al.
Pubblicazione: (2025)

Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
di: Peng, Pan, et al.
Pubblicazione: (2025)

Inner Product Aware Quantization: Provably Fast, Accurate, and Adaptive Algorithms
di: White, Nathan, et al.
Pubblicazione: (2026)

Fast White-Box Adversarial Streaming Without a Random Oracle
di: Feng, Ying, et al.
Pubblicazione: (2024)

Private Continual Counting of Unbounded Streams
di: Jacobsen, Ben, et al.
Pubblicazione: (2025)

Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
di: Meng, Lingkai, et al.
Pubblicazione: (2025)

Streaming Private Continual Counting via Binning
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2024)

Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
di: Roy, Shubhajit, et al.
Pubblicazione: (2023)

Fast and Simple Densest Subgraph with Predictions
di: Bui, Thai, et al.
Pubblicazione: (2025)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
di: Bishnu, Arijit, et al.
Pubblicazione: (2024)

Learning the Positions in CountSketch
di: Li, Yi, et al.
Pubblicazione: (2023)

Improved Approximations for Hard Graph Problems using Predictions
di: Aamand, Anders, et al.
Pubblicazione: (2025)

Cover Edge-Based Novel Triangle Counting
di: Bader, David A., et al.
Pubblicazione: (2024)

Spectral Guarantees for Adversarial Streaming PCA
di: Price, Eric, et al.
Pubblicazione: (2024)

Exact Learning of Weighted Graphs Using Composite Queries
di: Goodrich, Michael T., et al.
Pubblicazione: (2025)

Learning-Augmented Streaming Algorithms for Correlation Clustering
di: Dong, Yinhao, et al.
Pubblicazione: (2025)

Binned Group Algebra Factorization for Differentially Private Continual Counting
di: Henzinger, Monika, et al.
Pubblicazione: (2025)

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression
di: Chowdhury, Agniva, et al.
Pubblicazione: (2024)

Near-Optimal Four-Cycle Counting in Graph Streams
di: Lüderssen, Sebastian, et al.
Pubblicazione: (2026)

Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability
di: Wiesler, Eleanor, et al.
Pubblicazione: (2026)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
di: Black, Hadley, et al.
Pubblicazione: (2025)

Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
di: Shahout, Rana, et al.
Pubblicazione: (2024)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
di: Alman, Josh, et al.
Pubblicazione: (2025)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
di: Kannan, Ravindran, et al.
Pubblicazione: (2024)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
di: He, Yuchen, et al.
Pubblicazione: (2024)

Fast, robust approximate message passing
di: Ivkov, Misha, et al.
Pubblicazione: (2024)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
di: Meng, Lingkai, et al.
Pubblicazione: (2024)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
di: Karpov, Nikolai, et al.
Pubblicazione: (2025)

Fast and Efficient Matching Algorithm with Deadline Instances
di: Song, Zhao, et al.
Pubblicazione: (2023)

Fast online node labeling with graph subsampling
di: Huang, Yushen, et al.
Pubblicazione: (2025)

Accelerating Matroid Optimization through Fast Imprecise Oracles
di: Eberle, Franziska, et al.
Pubblicazione: (2024)

Fast-MWEM: Private Data Release in Sublinear Time
di: Haris, Themistoklis, et al.
Pubblicazione: (2026)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
di: Pham, Ninh, et al.
Pubblicazione: (2025)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2025)

New Bounds for Kernel Sums via Fast Spherical Embeddings
di: Wagner, Tal
Pubblicazione: (2026)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
di: Assadi, Sepehr, et al.
Pubblicazione: (2023)

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
di: Beretta, Lorenzo, et al.
Pubblicazione: (2025)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
di: Amanatidis, Georgios, et al.
Pubblicazione: (2020)

Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries
di: Bishnu, Arijit, et al.
Pubblicazione: (2025)