|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
34th Annual Symposium on Foundations of Computer Science (FOCS 1993)
Palo Alto, CA, USA
November 03-November 05
ISBN: 0-8186-4370-6
| ASCII Text | x | ||
| G. Barnes, J.A. Edmonds, "Time-space lower bounds for directed s-t connectivity on JAG models," Foundations of Computer Science, IEEE Annual Symposium on, pp. 228-237, 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), 1993. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1993.366864, author = {G. Barnes and J.A. Edmonds}, title = {Time-space lower bounds for directed s-t connectivity on JAG models}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1993}, isbn = {0-8186-4370-6}, pages = {228-237}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1993.366864}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Time-space lower bounds for directed s-t connectivity on JAG models SN - 0-8186-4370-6 SP228 EP237 A1 - G. Barnes, A1 - J.A. Edmonds, PY - 1993 KW - upper bound KW - directed s-t connectivity KW - JAG models KW - s-t connectivity KW - distinguished vertex KW - directed graph KW - time-space lower bound VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
Directed s-t connectivity is the problem of detecting whether there is a path from a distinguished vertex s to a distinguished vertex t in a directed graph. We prove time-space lower bounds of ST=/spl Omega/(n/sup 2//log n) and S/sup 1/2/T /spl Omega/(mn/sup 1/2/) for Cook and Rackoff's JAG model (1980), where n is the number of vertices and m the number of edges in the input graph, and S is the space and T the time used by the JAG. We also prove a time-space lower bound of S/sup 1/3/T=/spl Omega/(m/sup 2/3/n(2/3)) on the more powerful node-named JAG model of Poon (1993). These bounds approach the known upper bound of T=O(m) when S=/spl Theta/(n log n).
Index Terms:
upper bound, directed s-t connectivity, JAG models, s-t connectivity, distinguished vertex, directed graph, time-space lower bound
Citation:
G. Barnes, J.A. Edmonds, "Time-space lower bounds for directed s-t connectivity on JAG models," focs, pp.228-237, 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), 1993
Usage of this product signifies your acceptance of the Terms of Use.