Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ALENEX

2007

2007

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 state in which the graph is connected. It turns out that satisfying all of these demands at the same time is not easy. Our basic approach towards this goal is the so-called linearization technique: each node v repeatedly does the following with its neighbors: • for its left (i.e., smaller) neighbors u1, . . . , uk in the order of decreasing labels, v replaces {v, u1}, . . . , {v, uk} by {v, u1}, {u1, u2}, . . . , {uk−1, uk}, and • for its right (i.e., larger) neighbors w1, . . . , w in the o...

Added |
29 Oct 2010 |

Updated |
29 Oct 2010 |

Type |
Conference |

Year |
2007 |

Where |
ALENEX |

Authors |
Melih Onus, Andréa W. Richa, Christian Scheideler |

Comments (0)