Imagen de Portada

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Xuan, Wei, Liang, Yan, Cao, Huawei, Lin, Ning, Ye, Xiaochun, Fan, Dongrui
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast and Accurate Triangle Counting in Graph Streams Using Predictions
por: Boldrin, Cristian, et al.
Publicado: (2024)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
por: Assadi, Sepehr, et al.
Publicado: (2026)

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

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

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

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

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

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
por: Assadi, Sepehr, et al.
Publicado: (2025)

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

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

Publishing Below-Threshold Triangle Counts under Local Weight Differential Privacy
por: Pfisterer, Kevin, et al.
Publicado: (2026)

Maintaining $k$-MinHash Signatures over Fully-Dynamic Data Streams with Recovery
por: Clementi, Andrea, et al.
Publicado: (2024)

Triangle Counting with Local Edge Differential Privacy
por: Eden, Talya, et al.
Publicado: (2023)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
por: Zhao, Yibin
Publicado: (2025)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
por: Ye, Xiaowei, et al.
Publicado: (2024)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
por: Hebert-Johnson, Ursula, et al.
Publicado: (2023)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
por: Goranci, Gramoz, et al.
Publicado: (2023)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
por: Jin, Wenyu, et al.
Publicado: (2024)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
por: Madani, Amirali, et al.
Publicado: (2025)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
por: El-Hayek, Antoine, et al.
Publicado: (2024)

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2025)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
por: Assadi, Sepehr, et al.
Publicado: (2024)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
por: Chuzhoy, Julia, et al.
Publicado: (2026)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
por: Blank, Lotte, et al.
Publicado: (2025)

Triangle Detection in H-Free Graphs
por: Abboud, Amir, et al.
Publicado: (2025)

$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
por: Lin, Honghao, et al.
Publicado: (2025)

Fully Dynamic Euclidean k-Means
por: Bhattacharya, Sayan, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Chamfer Distance
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Transitive Reduction
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fully Dynamic Spectral Sparsification of Hypergraphs
por: Goranci, Gramoz, et al.
Publicado: (2025)

Dynamic Graph Coloring: Sequential, Parallel, and Distributed
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Optimal Static Fully Indexable Dictionaries
por: Liang, Jingxun, et al.
Publicado: (2025)

Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
por: Mao, Xiao
Publicado: (2023)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
por: Zhou, Alexander, et al.
Publicado: (2026)

Counting Patterns in Degenerate Graphs in Constant Space
por: Komarath, Balagopal, et al.
Publicado: (2025)