Abstract
In this paper we consider the problem of finding a legal source to sink (s-t) path in a digraph G = (V, E), for which a set of impossible paths is specified. This problem arises in program testing. An efficient algorithm is presented for the case when G is an acyclic digraph and the general problem is shown to be computationally intractable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
