Partial reversal acyclicity

Authors:
Tsvetomira Radeva;Nancy Lynch
Affiliations:
MIT, Cambridge, MA, USA;MIT, Cambridge, MA, USA
Venue:
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2011

Citing 2
Cited 0

Distributed Algorithms

Distributed Algorithms
Link Reversal Algorithms

Link Reversal Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partial Reversal (PR) is a link reversal algorithm which ensures that an initially directed acyclic graph (DAG) is eventually a destination-oriented DAG. 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 show that such labeling is not necessary and outline a simpler direct proof of the acyclicity property.