A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree
[article]
2014
arXiv
pre-print
We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of O(nΔ) bits per node and O(nD) respectively, where Δ is the highest degree of a node, n is the number of nodes and D is the
arXiv:1408.0384v2
fatcat:4mr7c6yekjclbc4bivcnxrf54u