Image de couverture de livre

Deterministic Dynamic Edge Colouring

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	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

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

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
par: de Vos, Tijn, et autres
Publié: (2024)

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

Deterministic Online Bipartite Edge Coloring
par: Blikstad, Joakim, et autres
Publié: (2024)

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

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
par: Elkin, Michael, et autres
Publié: (2024)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
par: Anand, Aditya, et autres
Publié: (2024)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
par: Adamson, Duncan, et autres
Publié: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

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

Dynamic Edge Coloring of Forests
par: Kaplan, Haim, et autres
Publié: (2026)

Kruskal-EDS: Edge Dynamic Stratification
par: Mercadier, Yves
Publié: (2026)

Deterministic Cache-Oblivious Funnelselect
par: Brodal, Gerth Stølting, et autres
Publié: (2024)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
par: Haeupler, Bernhard, et autres
Publié: (2024)

Simple Algorithms for Fully Dynamic Edge Connectivity
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
par: Goranci, Gramoz, et autres
Publié: (2023)

Packed Acyclic Deterministic Finite Automata
par: Shibata, Hiroki, et autres
Publié: (2024)

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

Deterministic Mincut in Almost-Linear Time
par: Li, Jason
Publié: (2021)

Faster Deterministic Streaming Vertex Coloring
par: Chechik, Shiri, et autres
Publié: (2026)

A Note on Deterministic FPTAS for Partition
par: Chen, Lin, et autres
Publié: (2025)

Engineering Edge Orientation Algorithms
par: Reinstädtler, H., et autres
Publié: (2024)

Beyond Vizing Chains: Improved Recourse in Dynamic Edge Coloring
par: Sadeh, Yaniv, et autres
Publié: (2026)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
par: El-Hayek, Antoine, et autres
Publié: (2023)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
par: Baguley, Samuel, et autres
Publié: (2024)

Vizing's Theorem in Deterministic Almost-Linear Time
par: Assadi, Sepehr, et autres
Publié: (2025)

Fast Practical Compression of Deterministic Finite Automata
par: Bille, Philip, et autres
Publié: (2023)

Deterministic Monotone Min-Plus Product and Convolution
par: Jin, Ce, et autres
Publié: (2026)

Noisy (Binary) Searching: Simple, Fast and Correct
par: Dereniowski, Dariusz, et autres
Publié: (2021)

Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
par: Nederlof, Jesper
Publié: (2025)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
par: Wan, Zongqi, et autres
Publié: (2024)

Deterministic Almost-Linear-Time Gomory-Hu Trees
par: Abboud, Amir, et autres
Publié: (2025)

Deterministic $k$-Median Clustering in Near-Optimal Time
par: Costa, Martín, et autres
Publié: (2025)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
par: Li, Jason
Publié: (2025)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
par: Dufay, Marc, et autres
Publié: (2025)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
par: Björklund, Andreas, et autres
Publié: (2024)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
par: Henzinger, Monika, et autres
Publié: (2024)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
par: Desikan, Hayagriv
Publié: (2026)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
par: Jiang, Yonggang, et autres
Publié: (2025)

Partitioning Trillion Edge Graphs on Edge Devices
par: Chhabra, Adil, et autres
Publié: (2024)