HAL (France)
open access
Distributed algorithms and local structures in graphs
In this thesis, we study constant-time distributed algorithms in the LOCAL model, that is, algorithms whosenumber of rounds is independent of the number of vertices, applied to the approximation of domination problems withinvarious graph classes. We provide approximation algorithms for MDS on parame
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
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#920237
- Tight Energy Lower Bounds for Distributed Graph Algorithms#467099
- A Uniform Algorithm for Strict NP on Bounded-Treedepth Graphs#1215659
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
Record · ID 1329133
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