On paths in networks with valves
We consider networks Ç with the property that valves are installed in some of the nodes v. Entering v by an arc (u, v) and leaving it by another arc (v, w) is only possible if (u, v) and (v, w) are connected by a valve adjustment. A path [x1,..., xk] is admissible if a valve adjustment exists which connects each arc (xk, xk + 1) with (xk + 1, xk + 2).
We investigate the complexity of deciding whether there exists an admissible path from a node s to another node t of Ç.
Unable to display preview. Download preview PDF.
- U.Braun, Graphentheoretische Modellierung und Lösungsverfahren bei der rechnergestützten Wegeplanung in der Prozeβautomatisierung. Diploma Thesis, University at Würzburg, Würzburg (1990).Google Scholar
- H.N.Gabow, S.N.Maheswari, L.J.Osterweil, On two problems in the generation of program test paths. IEEE Trans. Software Engrg. SE-2 (1976), page 227–231.Google Scholar
- U.Huckenbeck, Cost-Bounded Paths in Networks of Pipes with Valves. Technical Report No. 42, University at Würzburg, Institute of Computer Science (May 1992).Google Scholar