51 search results - page 1 / 11 » A Dynamic Algorithm for Topologically Sorting Directed Acycl... |
WEA
2004
Springer
13 years 11 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...
JEA
2006
13 years 5 months ago
2006
FCT
1993
Springer
13 years 9 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
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...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...