By Topic

How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Even, Shimon ; Dept. of Comput. Sci., Technion, Haifa, Israel ; Pnueli, Y.

A finite directed graph, G (V, E), is considered. The problem is to perform, online, a series of given requests to add or delete edges in the graph while keeping it acyclic. An algorithm that solves this problem is presented. The solution differs from that of S. Katz and O. Shmueli (1987) in that it has the following property. If every request to add an edge kj is such that there is no path from j to k which persists forever, then every request to add an edge is eventually granted. The message complexity of the algorithm is O(|E| |V |) messages per request

Published in:

Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)

Date of Conference:

22-25 Oct 1990