arXiv (All)
open access
Deterministic Self-Stabilizing BFS Construction in Constant Space
In this paper, we resolve a long-standing question in self-stabilization by demonstrating that it is indeed possible to construct a spanning tree in a semi-uniform network using constant memory per node. We introduce a self-stabilizing synchronous algorithm that builds a breadth-first search (BFS) s
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
- Graph Machine: Towards Better Pretraining via Edges#924997
- Graph Machine: Towards Better Pretraining via Edges#920763
- Convergence and Robustness Bounds for Distributed Asynchronous Shortest-Path#999663
- SHORTCUT: In-Collective Topology Reconfiguration for Low-Latency AllReduce#1141443
- Distributed Balanced Butterfly Counting in Signed Bipartite Graphs#1036237
Record · ID 1144716
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