A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Linearization: Locally Self-Stabilizing Sorting in Graphs
[chapter]

2007
*
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
*

We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This algorithm should be as simple as possible and, for scalability, should guarantee a polylogarithmic runtime as well as at most a polylogarithmic increase in the degree of each node during its execution. Furthermore, it should be selfstabilizing, that is, it should be able to eventually construct a sorted list from any

doi:10.1137/1.9781611972870.10
dblp:conf/alenex/OnusRS07
fatcat:6ahnrchidzclndgedzxgxgt6ka