On paths in networks with valves

  • Ulrich Huckenbeck
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)


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 Ç.


Polynomial Time Valve Function Valve Type Admissible Path Valve Adjustment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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
  2. [2]
    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
  3. [3]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Ulrich Huckenbeck
    • 1
  1. 1.Universität WürzburgWürzburgGermany

Personalised recommendations