arXiv (OAI Expanded)
open access
Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
Given a graph $G=(V,E)$, a $β$-ruling set is a subset of nodes $S\subseteq V$ that is independent, and each node in $V$ is at distance at most $β$ from some node in $S$. In this paper, we present almost optimal distributed algorithms for finding $2$-ruling sets in the classical LOCAL model. Our main
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity#271808
- Combinatorial optimization model, approximation and heuristic algorithms for identifying specific structures in networks#1066242
- Massively parallel tandem traversal of bounding volume hierarchies for geometric queries on distributed meshes#8264
- Sumset Structure in Local Computation#1037415
- Embedding rooted blow-ups of tree posets#1049282
Record · ID 1084250
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive