Maintaining Longest Paths in Cyclic Graphs.
Gespeichert in:
| Titel: | Maintaining Longest Paths in Cyclic Graphs. |
|---|---|
| Autoren: | Beek, Peter, Katriel, Irit1, Hentenryck, Pascal2 |
| Quelle: | Principles & Practice of Constraint Programming - CP 2005. 2005, p358-372. 15p. |
| Abstract: | This paper reconsiders the problem of maintaining longest paths in directed graphs, which is at the core of many scheduling applications. It presents bounded incremental algorithms for arc insertion and deletion running in time on graphs (i.e., graphs whose cycles have strictly negative lengths), where and are measures of the change in the input and output. For graphs, maintaining longest paths is unbounded under reasonable computational models; when only arc insertions are allowed, it is shown that the problem can be solved in time even in the presence of zero-length cycles. The algorithms directly apply to shortest paths (by negating the lengths), leading to simpler algorithms than previously known and reducing the worst-case complexity of an operation from to O(n + m) for graphs with n vertices and m arcs. [ABSTRACT FROM AUTHOR] |
| Datenbank: | Supplemental Index |
Schreiben Sie den ersten Kommentar!