A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We propose an incremental algorithm for the problem of maintaining systems of difference constraints. As a difference from the unidirectional approach of Ramalingam et al.  , it employs bidirectional search, which is similar to that of Alpern et al.  , and has a bounded runtime complexity in the worst case in terms of the size of changes. The major challenge is how to update the solution efficiently after the bidirectional search discovers a region that needs changes. Experimentaldoi:10.1007/s00453-004-1081-6 fatcat:7mb7rpwr4vdffljzsorctbeory