Sciweavers

36 search results - page 1 / 8
» A batch algorithm for maintaining a topological order
Sort
View
ACSC
2010
IEEE
13 years 5 months ago
A batch algorithm for maintaining a topological order
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...
David J. Pearce, Paul H. J. Kelly
DAM
2010
92views more  DAM 2010»
13 years 11 months ago
Average-case analysis of incremental topological ordering
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...
Deepak Ajwani, Tobias Friedrich
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
14 years 4 months ago
Balanced Batch LKH: New Proposal, Implementation and Performance Evaluation
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 ...
Josep Pegueroles, Francisco Rico-Novella
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 4 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
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...
David J. Pearce, Paul H. J. Kelly
ITCC
2005
IEEE
14 years 4 months ago
Performance Analysis of Mobile Backbone Topology Synthesis Algorithm for Wireless Ad Hoc Networks
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...
Laura Huei-jiun Ju, Izhak Rubin