Name
Abstract | ||
|---|---|---|
We deal with the problem of maintaining the heaviest paths in a DAG under edge insertion and deletion. Michel and Van Hentenryck [2] designed algorithms for this problem which work on DAGs with strictly positive edge weights. They handle edges of zero or negative weight by replacing each of them by (potentially many) edges with positive weights. In this paper we show an alternative solution, which has the same complexity and handles arbitrary edge weights without graph transformations. For the case in which all edge weights are integers, we show a second algorithm which is asymptotically faster. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24664-0_13 | CPAIOR |
Field | DocType | Volume |
Combinatorics,Mathematics | Conference | 3011 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.40 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Irit Katriel | 1 | 176 | 13.72 |
| jeancharles regin | 2 | 2 | 0.40 |
| Michel Rueher | 3 | 613 | 59.81 |