Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs

DOI10.1007/978-3-662-44777-2_33zbMath1425.68456OpenAlexW437401151MaRDI QIDQ2921425

Moti Medina, Dana Ron, Guy Even

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_33

zbMATH Keywords

graph algorithmssublinear approximation algorithmscentralized local algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (9)

New techniques and tighter bounds for local computation algorithms ⋮ Unnamed Item ⋮ Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs ⋮ Constant-time local computation algorithms ⋮ Local computation algorithms for graphs of non-constant degrees ⋮ Unnamed Item ⋮ Best of two local models: centralized local and distributed local algorithms ⋮ Local algorithms for sparse spanning graphs ⋮ Improved Dynamic Graph Coloring

This page was built for publication: Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs