On the computational complexity of dynamic graph problems

Ramalingam, G.; Reps, Thomas

doi:10.1016/0304-3975(95)00079-8

Cited by 206 publications

(229 citation statements)

References 17 publications

Supporting

Mentioning

229

Contrasting

Order By: Relevance

“…Ramalingam and Reps [6] describe the iterative algorithm RR that handles only edge insertions and deletions. It can be directly transferred to an algorithm that works with weight increases and decreases.…”

Section: Algorithm Of Ramalingam and Repsmentioning

confidence: 99%

“…Ramalingam and Reps [5] introduce the batch algorithm SWSF-FP, Narvaez et al [1] propose the NARVÁEZ-framework containing six single-edge update algorithms and a modification to the framework leading to the according batch algorithms. Pure single-edge update algorithms are RR [6] (due to Ramalingam and Reps) and FMN [7] (by Frigioni et al). All these algorithms are described shortly in Section 3.…”

Section: Introductionmentioning

confidence: 99%

“…In [6] the algorithm RR is adapted to cope with the existence of negative cycles, in [10] the same is done for the algorithm FMN. In [11] Demetrescu gives some algorithms for that problem.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study

Bauer

Wagner

2009

Experimental Algorithms

View full text Add to dashboard Cite

Abstract. A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully-dynamic batch algorithms for singlesource shortest paths in directed graphs with positive edge weights. We give an extensive experimental study of the existing algorithms for the single-edge and the batch case, including a broad set of test instances. We further present tuned variants of the already existing SWSF-FP-algorithm being up to 15 times faster than SWSF-FP. A surprising outcome of the paper is the astonishing level of data dependency of the algorithms.

show abstract

Section: Algorithm Of Ramalingam and Repsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study

Bauer

Wagner

2009

Experimental Algorithms

View full text Add to dashboard Cite

show abstract

“…It is unbounded otherwise. Many incremental problems are unbounded (e.g., graph reachability under the local persistent model [19]) and hence the existence of a bounded algorithm is a strong guarantee for incremental performance.…”

Section: Bounded Incremental Computationmentioning

confidence: 99%

“…The paper presents bounded incremental algorithms for these two operations which [19]. The BIC model differentiates more incremental algorithms than the traditional online computation model, which only analyzes algorithms in terms of the input size.…”

Section: Introductionmentioning

confidence: 99%

Maintaining Longest Paths Incrementally

Michel

Hentenryck

2003

Principles and Practice of Constraint Programming – CP 2003

View full text Add to dashboard Cite

Abstract. Modeling and programming tools for neighborhood search often support invariants, i.e., data structures specified declaratively and automatically maintained incrementally under changes. This paper considers invariants for longest paths in directed acyclic graphs, a fundamental abstraction for many applications. It presents bounded incremental algorithms for arc insertion and deletion which run in

show abstract