Partial Reversal Acyclicity
Name
MIT-CSAIL-TR-2011-022.pdf
Size
508.42 KB
Format
Adobe PDF
Checksum (MD5)
670718f4992d6d89bfff798bd8c2ab9f
Author(s)
Radeva, Tsvetomira
Lynch, Nancy A.
Advisor(s)
Nancy Lynch
Date Issued
April 14, 2011
Series/Report no.
MIT-CSAIL-TR-2011-022
Abstract
Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving leader election and mutual exclusion. While proofs exist to establish the acyclicity property of PR, they rely on assigning labels to either the nodes or the edges in the graph. In this work we present simpler direct proof of the acyclicity property of partial reversal without using any external or dynamic labeling mechanism. First, we provide a simple variant of the PR algorithm, and show that it maintains acyclicity. Next, we present a binary relation which maps the original PR algorithm to the new algorithm, and finally, we conclude that the acyclicity proof applies to the original PR algorithm as well.
Subjects
Partial Reversal
Link Reversal
Graph Algorithms
Persistent DSpace Link
