Image de couverture de livre

Estimating Diffusion Degree on Graph Streams

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gore, Vinit Ramesh, Kundu, Suman, Pratiwi, Anggy Eka
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
par: Beretta, Lorenzo, et autres
Publié: (2025)

Realization of Temporally Connected Graphs Based on Degree Sequences
par: Casteigts, Arnaud, et autres
Publié: (2025)

PageRank Centrality in Directed Graphs with Bounded In-Degree
par: Thorup, Mikkel, et autres
Publié: (2025)

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

Constructing Long Paths in Graph Streams
par: Konrad, Christian, et autres
Publié: (2025)

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
par: Kumar, Akash, et autres
Publié: (2026)

Estimating Correlation Clustering Cost in Node-Arrival Stream
par: Liu, Kaiwen, et autres
Publié: (2026)

Streaming Graph Algorithms in the Massively Parallel Computation Model
par: Czumaj, Artur, et autres
Publié: (2025)

Near-Optimal Four-Cycle Counting in Graph Streams
par: Lüderssen, Sebastian, et autres
Publié: (2026)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
par: Kiran, Mekala, et autres
Publié: (2026)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
par: Meng, Lingkai, et autres
Publié: (2024)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
par: Chaplick, Steven, et autres
Publié: (2024)

New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
par: Ghosh, Prantar, et autres
Publié: (2024)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
par: Bishnu, Arijit, et autres
Publié: (2024)

GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
par: Jananthan, Hayden, et autres
Publié: (2025)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
par: Xuan, Wei, et autres
Publié: (2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

Graph Exploration with Edge Weight Estimates
par: Gehnen, Matthias, et autres
Publié: (2025)

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

Estimating Random-Walk Probabilities in Directed Graphs
par: Bertram, Christian, et autres
Publié: (2025)

Personalized PageRank Estimation in Undirected Graphs
par: Bertram, Christian, et autres
Publié: (2026)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
par: Hamm, Thekla, et autres
Publié: (2022)

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
par: Feng, Yilong, et autres
Publié: (2025)

On the Streaming Complexity of Expander Decomposition
par: Chen, Yu, et autres
Publié: (2024)

Streaming Algorithms for Connectivity Augmentation
par: Jin, Ce, et autres
Publié: (2024)

Buffered Streaming Edge Partitioning
par: Chhabra, Adil, et autres
Publié: (2024)

Multi-Slot Tag Assignment Problem in Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2024)

Adaptively Robust Resettable Streaming
par: Cohen, Edith, et autres
Publié: (2026)

Sketching and Streaming for Dictionary Compression
par: Becker, Ruben, et autres
Publié: (2023)

Streaming Algorithms for Network Design
par: Chekuri, Chandra, et autres
Publié: (2025)

Error Correction for Message Streams
par: Gupta, Meghal, et autres
Publié: (2023)

Improved Streaming Edge Coloring
par: Chechik, Shiri, et autres
Publié: (2025)

Streaming algorithms for products of probabilities
par: Lohrey, Markus, et autres
Publié: (2025)

Lower Bounds for Testing Directed Acyclicity in the Unidirectional Bounded-Degree Model
par: Yoshida, Yuichi
Publié: (2026)

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
par: Wang, Hanzhi
Publié: (2024)

Dynamic and Streaming Algorithms for Union Volume Estimation
par: Bhore, Sujoy, et autres
Publié: (2026)

Streaming Algorithms with Few State Changes
par: Jayaram, Rajesh, et autres
Publié: (2024)

Semi-Streaming Algorithms for Graph Property Certification
par: Das, Avinandan, et autres
Publié: (2025)

Streaming Complexity Separations for Dense and Sparse Graphs
par: Liu, Yang P., et autres
Publié: (2026)