Imagen de Portada

Sparsity-Parameterised Dynamic Edge Colouring

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Christiansen, Aleksander B. G., Rotenberg, Eva, Vlieghe, Juliette
Formato:	Preprint
Publicado:	2023
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

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

Deterministic Dynamic Edge Colouring
por: Christiansen, Aleksander B. G.
Publicado: (2024)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
por: Großmann, Ernestine, et al.
Publicado: (2025)

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

Local Density and its Distributed Approximation
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
por: Holm, Jacob, et al.
Publicado: (2025)

Simpler Universally Optimal Dijkstra
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Engineering Fully Dynamic Convex Hulls
por: van der Hoog, Ivor, et al.
Publicado: (2026)

FPT Parameterisations of Fractional and Generalised Hypertree Width
por: Lanzinger, Matthias, et al.
Publicado: (2025)

Near-Optimal Heaps and Dijkstra on Pointer Machines
por: van der Hoog, Ivor, et al.
Publicado: (2026)

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

Parameterised distance to local irregularity
por: Fioravantes, Foivos, et al.
Publicado: (2023)

Parameterised algorithms for temporally satisfying reconfiguration problems
por: Davot, Tom, et al.
Publicado: (2025)

String Indexing for Top-$k$ Close Consecutive Occurrences
por: Bille, Philip, et al.
Publicado: (2020)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)

On computing the (exact) Fréchet distance with a frog
por: Conradi, Jacobus, et al.
Publicado: (2025)

Data Structures for Approximate Discrete Fréchet Distance
por: van der Hoog, Ivor, et al.
Publicado: (2022)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
por: Bille, Philip, et al.
Publicado: (2022)

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

Discrepancy Minimization in Input-Sparsity Time
por: Deng, Yichuan, et al.
Publicado: (2022)

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

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

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

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
por: Conradi, Jacobus, et al.
Publicado: (2026)

Efficient Greedy Discrete Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2025)

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

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

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

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

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

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

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

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

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

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
por: de Berg, Sarita, et al.
Publicado: (2026)

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

Improved Streaming Edge Coloring
por: Chechik, Shiri, et al.
Publicado: (2025)

Buffered Streaming Edge Partitioning
por: Chhabra, Adil, et al.
Publicado: (2024)