Brief Announcement: Partial Reversal Acyclicity
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 thi...
Main Authors: | Radeva, Tsvetomira, Lynch, Nancy Ann |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2012
|
Online Access: | http://hdl.handle.net/1721.1/73185 https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-1261-6681 |
Similar Items
-
Partial Reversal Acyclicity
by: Radeva, Tsvetomira, et al.
Published: (2011) -
Brief announcement: Minimum spanning trees and cone-based topology control
by: Cornejo Collado, Alex, et al.
Published: (2010) -
Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
by: Newport, Calvin Charles, et al.
Published: (2010) -
Brief announcement: On simple back-off in unreliable radio networks
by: Lynch, Nancy
Published: (2021) -
Brief announcement: Integrating temporal information to spatial information in a neural circuit
by: Lynch, Nancy Ann, et al.
Published: (2021)