Image de couverture de livre

On Distributed Colouring of Hyperbolic Random Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Maus, Yannic, Ruff, Janosch
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms 68W15
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model
par: Robinson, Peter, et autres
Publié: (2025)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
par: Göbel, Andreas, et autres
Publié: (2025)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
par: Lynch, Nancy
Publié: (2024)

On the Advice Complexity of Online Unit Clustering
par: Nagy-György, Judit
Publié: (2023)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
par: Gribelyuk, Elena, et autres
Publié: (2024)

The Telephone $k$-Multicast Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

satsuma: Structure-based Symmetry Breaking in SAT
par: Anders, Markus, et autres
Publié: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
par: Hung, Chia-Yang, et autres
Publié: (2024)

Algorithms Transcending the SAT-Symmetry Interface
par: Anders, Markus, et autres
Publié: (2023)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

The Berlekamp-Massey Algorithm revisited
par: Atti, Nadia Ben, et autres
Publié: (2022)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
par: Borodin, Allan, et autres
Publié: (2025)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
par: Chiclana, Rafael, et autres
Publié: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Optimizing Exact String Matching via Statistical Anchoring
par: Garraoui, Omar
Publié: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

On the on-line coloring of unit interval graphs with proper interval representation
par: Curbelo, Israel R., et autres
Publié: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
par: Bansal, Ishan, et autres
Publié: (2024)

Strengths and Limitations of Greedy in Cup Games
par: Jasińska, Kalina, et autres
Publié: (2026)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

Optimal Online Bipartite Matching in Degree-2 Graphs
par: Bhangale, Amey, et autres
Publié: (2025)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
par: Andreou, Pantelis, et autres
Publié: (2024)

Additive estimates of the permanent using Gaussian fields
par: Mukerji, Tantrik, et autres
Publié: (2022)

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

Quasi-optimal hierarchically semi-separable matrix approximation
par: Amsel, Noah, et autres
Publié: (2025)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
par: Date, Vinicius T. V., et autres
Publié: (2025)

Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
par: Friedl, Katalin, et autres
Publié: (2025)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
par: Gupta, Swati, et autres
Publié: (2025)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
par: Crochemore, Maxime, et autres
Publié: (2025)

Residual Prophet Inequalities
par: Correa, Jose, et autres
Publié: (2025)