TCS
1998
14 years 8 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
74
Voted
WEA
2004
Springer
15 years 2 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...