Imagen de Portada

Deterministic Dynamic Edge Colouring

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Christiansen, Aleksander B. G.
Formato:	Preprint
Publicado:	2024
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

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

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
por: de Vos, Tijn, et al.
Publicado: (2024)

Private graph colouring with limited defectiveness
por: Christiansen, Aleksander B. G., et al.
Publicado: (2024)

Deterministic Online Bipartite Edge Coloring
por: Blikstad, Joakim, et al.
Publicado: (2024)

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

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
por: Elkin, Michael, et al.
Publicado: (2024)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
por: Anand, Aditya, et al.
Publicado: (2024)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
por: Adamson, Duncan, et al.
Publicado: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
por: Bernstein, Aaron, et al.
Publicado: (2025)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Dynamic Edge Coloring of Forests
por: Kaplan, Haim, et al.
Publicado: (2026)

Kruskal-EDS: Edge Dynamic Stratification
por: Mercadier, Yves
Publicado: (2026)

Deterministic Cache-Oblivious Funnelselect
por: Brodal, Gerth Stølting, et al.
Publicado: (2024)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
por: Haeupler, Bernhard, et al.
Publicado: (2024)

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

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

Packed Acyclic Deterministic Finite Automata
por: Shibata, Hiroki, et al.
Publicado: (2024)

Faster Pseudo-Deterministic Minimum Cut
por: Kenneth-Mordoch, Yotam
Publicado: (2026)

Deterministic Mincut in Almost-Linear Time
por: Li, Jason
Publicado: (2021)

Faster Deterministic Streaming Vertex Coloring
por: Chechik, Shiri, et al.
Publicado: (2026)

A Note on Deterministic FPTAS for Partition
por: Chen, Lin, et al.
Publicado: (2025)

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

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

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

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
por: Baguley, Samuel, et al.
Publicado: (2024)

Vizing's Theorem in Deterministic Almost-Linear Time
por: Assadi, Sepehr, et al.
Publicado: (2025)

Fast Practical Compression of Deterministic Finite Automata
por: Bille, Philip, et al.
Publicado: (2023)

Deterministic Monotone Min-Plus Product and Convolution
por: Jin, Ce, et al.
Publicado: (2026)

Noisy (Binary) Searching: Simple, Fast and Correct
por: Dereniowski, Dariusz, et al.
Publicado: (2021)

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

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, et al.
Publicado: (2024)

Deterministic Almost-Linear-Time Gomory-Hu Trees
por: Abboud, Amir, et al.
Publicado: (2025)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
por: Li, Jason
Publicado: (2025)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
por: Dufay, Marc, et al.
Publicado: (2025)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
por: Björklund, Andreas, et al.
Publicado: (2024)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
por: Henzinger, Monika, et al.
Publicado: (2024)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
por: Desikan, Hayagriv
Publicado: (2026)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
por: Jiang, Yonggang, et al.
Publicado: (2025)

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