36 search results - page 1 / 8 » A batch algorithm for maintaining a topological order |
ACSC
2010
IEEE
13 years 1 days ago
2010
IEEE
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...
DAM
2010
13 years 5 months ago
2010
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...
ISCC
2003
IEEE
13 years 10 months ago
2003
IEEE
Perfect Secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A Key Server must ...
WEA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
ITCC
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper, we present a scalable fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backb...