Results 1  10
of
216
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
 In Proc. of ACM Symposium on Theory of Computing
, 2004
"... We obtain a new fully dynamic algorithm for the reachability problem in directed graphs. Our algorithm has an amortized update time of O(m+n log n) and a worstcase query time of O(n), where m is the current number of edges in the graph, and n is the number of vertices in the graph. Each update oper ..."
Abstract

Cited by 39 (2 self)
 Add to MetaCart
We obtain a new fully dynamic algorithm for the reachability problem in directed graphs. Our algorithm has an amortized update time of O(m+n log n) and a worstcase query time of O(n), where m is the current number of edges in the graph, and n is the number of vertices in the graph. Each update
Improved Fully Dynamic Reachability Algorithm for Directed
, 2005
"... We propose a fully dynamic algorithm for maintaining reachability information in directed graphs. The proposed deterministic dynamic algorithm has an update time of O((ins ∗ n2) + (del ∗ (m + n ∗ log(n)))) where m is the current number of edges, n is the number of vertices in the graph, ins is the n ..."
Abstract
 Add to MetaCart
We propose a fully dynamic algorithm for maintaining reachability information in directed graphs. The proposed deterministic dynamic algorithm has an update time of O((ins ∗ n2) + (del ∗ (m + n ∗ log(n)))) where m is the current number of edges, n is the number of vertices in the graph, ins
Bucket Elimination: A Unifying Framework for Reasoning
"... Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problemsolving and reasoning tasks. Algorithms such as directionalresolution for propositional satisfiability, adaptiveconsistency for constraint satisfaction, Fourier and Gaussian elimination ..."
Abstract

Cited by 298 (58 self)
 Add to MetaCart
elimination for solving linear equalities and inequalities, and dynamic programming for combinatorial optimization, can all be accommodated within the bucket elimination framework. Many probabilistic inference tasks can likewise be expressed as bucketelimination algorithms. These include: belief updating
Fully Dynamic Algorithms for Path Problems on Directed Graphs
, 2001
"... In this thesis we investigate fully dynamic algorithms for path problems on directed graphs. In particular, we focus on two of the most fundamental path problems: fully dynamic transitive closure and fully dynamic singlesource shortest paths. The first part of the thesis presents a new technique wh ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
based approach, we also address the problem of maintaining implicitly the transitive closure of a directed graph and we devise the first algorithm which supports both updates and reachability queries in subquadratic time per operation. This result proves that it is actually possible to break t...
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs
"... We consider the problem of maintaining the transitive closure in a directed graph under edge insertions and deletions from the point of view of average case analysis. Say n the number of nodes and m the number of edges. We present a data structure that supports the report of a path between two no ..."
Abstract
 Add to MetaCart
We consider the problem of maintaining the transitive closure in a directed graph under edge insertions and deletions from the point of view of average case analysis. Say n the number of nodes and m the number of edges. We present a data structure that supports the report of a path between two
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
 In Proc. 31st ACM Symposium on Theory of Computing (STOC'99
, 1999
"... This paper presents an efficient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the adjacency matrix of the transitive closure with each update to the graph. Hence, each reachability query of the form "Is there a directed path fro ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
This paper presents an efficient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the adjacency matrix of the transitive closure with each update to the graph. Hence, each reachability query of the form "Is there a directed path
Fully Dynamic Biconnectivity in Graphs
, 1992
"... We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletions. It requires linear storage and preprocessing time. The amortized running time for insertions and for deletions is O(m 2=3 ), where m is the number of edges in the graph ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletions. It requires linear storage and preprocessing time. The amortized running time for insertions and for deletions is O(m 2=3 ), where m is the number of edges
Fully Dynamic CycleEquivalence in Graphs
 Proc. 35th Symp. on Foundations of Computer Science
, 1994
"... Two edges e 1 and e 2 of an undirected graph are cycleequivalent iff all cycles that contain e 1 also contain e 2 , i.e., iff e 1 and e 2 are a cutedge pair. The cycleequivalence classes of the controlflow graph are used in optimizing compilers to speed up existing controlflow and dataflow alg ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
flow algorithms. While the cycleequivalence classes can be computed in linear time, we present the first fully dynamic algorithm for maintaining the cycleequivalence relation. In an n node graph our data structure executes an edge insertion or deletion in O( p n log n) time and answers the query whether two
Fully dynamic recognition algorithm and certificate for directed cographs
"... This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) time where d is the number of arcs involved in the operation. Mor ..."
Abstract
 Add to MetaCart
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) time where d is the number of arcs involved in the operation
Orienting Fully Dynamic Graphs with WorstCase Time Bounds
, 2014
"... In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab on th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab
Results 1  10
of
216