Image de couverture de livre

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	de Vos, Tijn, Christiansen, Aleksander B. G.
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

Dynamic Matroids: Base Packing and Covering
par: de Vos, Tijn, et autres
Publié: (2025)

Distributed Sparsest Cut via Eigenvalue Estimation
par: Maus, Yannic, et autres
Publié: (2025)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
par: Jin, Wenyu, et autres
Publié: (2024)

Deterministic Dynamic Edge Colouring
par: Christiansen, Aleksander B. G.
Publié: (2024)

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
par: Cruciani, Emilio, et autres
Publié: (2025)

Deterministic Edge Coloring with few Colors in CONGEST
par: Blikstad, Joakim, et autres
Publié: (2026)

Sparsity-Parameterised Dynamic Edge Colouring
par: Christiansen, Aleksander B. G., et autres
Publié: (2023)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
par: Dory, Michal, et autres
Publié: (2022)

Arboricity-Dependent Algorithms for Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Fast Algorithms for Graph Arboricity and Related Problems
par: Cen, Ruoxu, et autres
Publié: (2025)

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
par: Brand, Jan van den, et autres
Publié: (2025)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
par: Cheng, Yu, et autres
Publié: (2024)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
par: Dong, Sally, et autres
Publié: (2023)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
par: Dai, Jiangqi, et autres
Publié: (2025)

Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
par: Zhao, Yibin
Publié: (2025)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
par: Chuzhoy, Julia, et autres
Publié: (2026)

Faster Pseudo-Deterministic Minimum Cut
par: Kenneth-Mordoch, Yotam
Publié: (2026)

Faster Global Minimum Cut with Predictions
par: Moseley, Benjamin, et autres
Publié: (2025)

Maintaining $k$-MinHash Signatures over Fully-Dynamic Data Streams with Recovery
par: Clementi, Andrea, et autres
Publié: (2024)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
par: Liu, Yuxi, et autres
Publié: (2024)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
par: El-Hayek, Antoine, et autres
Publié: (2024)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
par: Bringmann, Karl, et autres
Publié: (2024)

Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries
par: Bishnu, Arijit, et autres
Publié: (2025)

Private graph colouring with limited defectiveness
par: Christiansen, Aleksander B. G., et autres
Publié: (2024)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
par: Kurkure, Yash, et autres
Publié: (2024)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies
par: Jiang, Yonggang, et autres
Publié: (2025)

Min-Max Connected Multiway Cut
par: Tiwary, Hans Raj, et autres
Publié: (2026)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
par: El-Hayek, Antoine, et autres
Publié: (2025)

The Power of Migrations in Dynamic Bin Packing
par: Mellou, Konstantina, et autres
Publié: (2024)

A tight quasi-polynomial bound for Global Label Min-Cut
par: Jaffke, Lars, et autres
Publié: (2022)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

Faster Convolutions: Yates and Strassen Revisited
par: Brand, Cornelius, et autres
Publié: (2025)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
par: Anand, Aditya, et autres
Publié: (2025)

Parameterized Critical Node Cut Revisited
par: Knop, Dušan, et autres
Publié: (2025)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
par: Iwata, Satoru, et autres
Publié: (2024)

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
par: Geft, Tzvika, et autres
Publié: (2025)

Fully Dynamic Euclidean k-Means
par: Bhattacharya, Sayan, et autres
Publié: (2025)

Fully Dynamic Algorithms for Chamfer Distance
par: Goranci, Gramoz, et autres
Publié: (2025)

Fully Dynamic Algorithms for Transitive Reduction
par: Goranci, Gramoz, et autres
Publié: (2025)