Abstract
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 [x 1,..., x k] is admissible if a valve adjustment exists which connects each arc (x k, x k + 1) with (x k + 1, x k + 2).
We investigate the complexity of deciding whether there exists an admissible path from a node s to another node t of Ç.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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).
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.
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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huckenbeck, U. (1993). On paths in networks with valves. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive