Brief Announcement: Partial Reversal Acyclicity

Author(s)
Radeva, Tsvetomira; Lynch, Nancy Ann
Thumbnail
DownloadLynch_Brief Announcement.pdf (170.0Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Date issued
2011
URI
http://hdl.handle.net/1721.1/73185
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '11)
Publisher
Association for Computing Machinery (ACM)
Citation
Tsvetomira Radeva and Nancy Lynch. "Brief Announcement: Partial Reversal Acyclicity." In Proceedings of the 30th annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '11). ACM, New York, NY, USA, 353-354.
Version: Author's final manuscript
Collections