Abstract
We consider the problem of the relative complexity of the connectivity and reachability ( s-t -connectivity) problems, in a model resembling the one used for graph properties. In our model an oracle answers queries about edge-induced subgraphs, and we count the number of queries made. The main result is that in order to determine whether t is reachable from s one has to ask Ω(n 2 ) questions about the connectivity of edge-induced subgraphs. For non-adaptive strategies we show that n 2 questions are necessary for n ≥6. Several other results are included.
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.
