:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Mercadier, Yves
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2603.02006
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Algorithms for Verifying Kruskal Rank in Sparse Linear Regression and Related Applications
by: Zhou, Fengqin
Published: (2025)

Dynamic Edge Coloring of Forests
by: Kaplan, Haim, et al.
Published: (2026)

Deterministic Dynamic Edge Colouring
by: Christiansen, Aleksander B. G.
Published: (2024)

Sparsity-Parameterised Dynamic Edge Colouring
by: Christiansen, Aleksander B. G., et al.
Published: (2023)

Simple Algorithms for Fully Dynamic Edge Connectivity
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)

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

Beyond Vizing Chains: Improved Recourse in Dynamic Edge Coloring
by: Sadeh, Yaniv, et al.
Published: (2026)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
by: El-Hayek, Antoine, et al.
Published: (2023)

Partitioning Trillion Edge Graphs on Edge Devices
by: Chhabra, Adil, et al.
Published: (2024)

Engineering Edge Orientation Algorithms
by: Reinstädtler, H., et al.
Published: (2024)

Edge-weighted Matching in the Dark
by: Huang, Zhiyi, et al.
Published: (2025)

Improved Streaming Edge Coloring
by: Chechik, Shiri, et al.
Published: (2025)

Buffered Streaming Edge Partitioning
by: Chhabra, Adil, et al.
Published: (2024)

Edge-Tilting Field Dynamics: Rapid Mixing at the Uniqueness Threshold and Optimal Mixing for Swendsen-Wang Dynamics
by: Chen, Xiaoyu, et al.
Published: (2026)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
by: Georgiadis, Loukas, et al.
Published: (2026)

Online Edge Coloring: Sharp Thresholds
by: Blikstad, Joakim, et al.
Published: (2025)

Faster Edge Coloring by Partition Sieving
by: Akmal, Shyan, et al.
Published: (2025)

Graph Exploration with Edge Weight Estimates
by: Gehnen, Matthias, et al.
Published: (2025)

Weighted Partition Vertex and Edge Cover
by: Dabas, Rajni, et al.
Published: (2025)

Deterministic Online Bipartite Edge Coloring
by: Blikstad, Joakim, et al.
Published: (2024)

Arboricity-Dependent Algorithms for Edge Coloring
by: Bhattacharya, Sayan, et al.
Published: (2023)

Low-Cost Arborescence Under Edge Faults
by: Dey, Dipan, et al.
Published: (2026)

Deterministic Edge Coloring with few Colors in CONGEST
by: Blikstad, Joakim, et al.
Published: (2026)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2024)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
by: Crane, Alex, et al.
Published: (2023)

Streaming Edge Coloring with Subquadratic Palette Size
by: Chechik, Shiri, et al.
Published: (2023)

On the Complexity of Distributed Edge Coloring and Orientation Problems
by: Brandt, Sebastian, et al.
Published: (2025)

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

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
by: He, Jialin, et al.
Published: (2025)

Online Edge Coloring is (Nearly) as Easy as Offline
by: Blikstad, Joakim, et al.
Published: (2024)

Algorithm Engineering of SSSP With Negative Edge Weights
by: Cassis, Alejandro, et al.
Published: (2025)

Exact Clique Number Manipulation via Edge Interdiction
by: Zhou, Yi, et al.
Published: (2026)

Fast and Faithful Edge Bundling using Spectral Sparsification
by: Jiang, Xingjue, et al.
Published: (2026)

Edge-Minimum Walk of Modular Length in Polynomial Time
by: Amarilli, Antoine, et al.
Published: (2024)

Capacitated Partition Vertex Cover and Partition Edge Cover
by: Dabas, Rajni, et al.
Published: (2025)

Two-Edge Connectivity via Pac-Man Gluing
by: Garg, Mohit, et al.
Published: (2024)

Faster Vizing and Near-Vizing Edge Coloring Algorithms
by: Assadi, Sepehr
Published: (2024)

Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty
by: Tsou, Cheng-Hsiao, et al.
Published: (2024)

A Randomized Rounding Approach for DAG Edge Deletion
by: Kalantarzadeh, Sina, et al.
Published: (2025)

Density-Sensitive Algorithms for $(Δ+ 1)$-Edge Coloring
by: Bhattacharya, Sayan, et al.
Published: (2023)