Image de couverture de livre

An Efficient Streaming Algorithm for Approximating Graphlet Distributions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bressan, Marco, Chan, T-H. Hubert, Kuang, Qipeng, Sozio, Mauro
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Databases Social and Information Networks
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Counting hypertriangles through hypergraph orientations
par: Paul-Pena, Daniel, et autres
Publié: (2026)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
par: Lin, Wenqing, et autres
Publié: (2025)

Effective Individual Fairest Community Search over Heterogeneous Information Networks
par: Zhao, Taige, et autres
Publié: (2024)

Counting Graphlets of Size $k$ under Local Differential Privacy
par: Suppakitpaisarn, Vorapong, et autres
Publié: (2025)

Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
par: Bressan, Marco, et autres
Publié: (2026)

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
par: Najafi, Mohammad Matin, et autres
Publié: (2025)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
par: Pan, Yunjie, et autres
Publié: (2024)

Triadic First-Order Logic Queries in Temporal Networks
par: Bhalerao, Omkar, et autres
Publié: (2025)

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
par: Venturin, Giorgio, et autres
Publié: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
par: Spaeh, Fabian, et autres
Publié: (2025)

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
par: Bishnu, Arijit, et autres
Publié: (2025)

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
par: Chen, Zixuan, et autres
Publié: (2023)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
par: Brandt-Tumescheit, Fabian, et autres
Publié: (2024)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

Improved Approximation Algorithms for Relational Clustering
par: Esmailpour, Aryan, et autres
Publié: (2024)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
par: Li, Songhua, et autres
Publié: (2023)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
par: Zhao, Fuheng, et autres
Publié: (2023)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
par: Qi, Yiyan, et autres
Publié: (2024)

Fast Percolation Centrality Approximation with Importance Sampling
par: Cruciani, Antonio, et autres
Publié: (2025)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
par: Ali, Dildar, et autres
Publié: (2026)

Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
par: Liu, Kaiwen, et autres
Publié: (2026)

Efficiently Constructing Sparse Navigable Graphs
par: Conway, Alex, et autres
Publié: (2025)

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
par: Cruciani, Antonio
Publié: (2023)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
par: Ning, Baoling, et autres
Publié: (2024)

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
par: Srivastava, Ajitesh, et autres
Publié: (2024)

Fast Approximate CoSimRanks via Random Projections
par: Yang, Renchi, et autres
Publié: (2020)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
par: Bläsius, Thomas, et autres
Publié: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
par: Basu, Sabyasachi, et autres
Publié: (2024)

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
par: Han, Seongjune, et autres
Publié: (2026)

On the External Validity of Average-Case Analyses of Graph Algorithms
par: Bläsius, Thomas, et autres
Publié: (2022)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
par: Chen, Jingbang, et autres
Publié: (2024)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
par: You, Fangchen
Publié: (2025)

Graphlets correct for the topological information missed by random walks
par: Windels, Sam F. L., et autres
Publié: (2024)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
par: Huang, Qiang, et autres
Publié: (2024)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
par: Ertl, Otmar
Publié: (2024)