{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:11:39Z","timestamp":1748751099865,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_52","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"614-624","source":"Crossref","is-referenced-by-count":1,"title":["An $$O(n^{\\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs"],"prefix":"10.1007","author":[{"given":"Diptarka","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghunath","family":"Tewari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Imai, T., Nakagawa, K., Pavan, A., Vinodchandran, N., Watanabe, O.: An $${O}(n^{1\/2+\\epsilon }$$ )-space and polynomial-time algorithm for directed planar reachability. In: 2013 IEEE Conference on Computational Complexity (CCC), pp. 277\u2013286 (2013)","DOI":"10.1109\/CCC.2013.35"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","volume":"19","author":"HR Lewis","year":"1982","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Symmetric space-bounded computation. Theor. Comput. Sci. 19, 161\u2013187 (1982)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"52_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 1\u201324 (2008)","journal-title":"J. ACM"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Pseudorandom walks on regular digraphs and the RL vs. L problem. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 457\u2013466. ACM, New York (2006)","DOI":"10.1145\/1132516.1132583"},{"issue":"3","key":"52_CR5","doi-asserted-by":"publisher","first-page":"30:1","DOI":"10.1145\/1978782.1978785","volume":"7","author":"KM Chung","year":"2011","unstructured":"Chung, K.M., Reingold, O., Vadhan, S.: S-t connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7(3), 30:1\u201330:21 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Lange, K.J.: An unambiguous class possessing a complete set. In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1997, pp. 339\u2013350 (1997)","DOI":"10.1007\/BFb0023471"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-55808-X_10","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A Wigderson","year":"1992","unstructured":"Wigderson, A.: The complexity of graph connectivity. In: Havel, Ivan M., Koubek, V\u00e1clav (eds.) MFCS 1992. LNCS, vol. 629, pp. 112\u2013132. Springer, Heidelberg (1992)"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Barnes, G., Buss, J.F., Ruzzo, W.L., Schieber, B.: A sublinear space, polynomial time algorithm for directed s-t connectivity. In: Proceedings of the Seventh Annual Conference on Structure in Complexity Theory, pp. 27\u201333 (1992)","DOI":"10.1109\/SCT.1992.215378"},{"key":"52_CR10","unstructured":"Asano, T., Doerr, B.: Memory-constrained algorithms for shortest path problem. In: CCCG (2011)"},{"key":"52_CR11","unstructured":"Chakraborty, D., Pavan, A., Tewari, R., Vinodchandran, N.V., Yang, L.: New time-space upperbounds for directed reachability in high-genus and H-minor-free graphs. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15\u201317, 2014, New Delhi, pp. 585\u2013595 (2014)"},{"key":"52_CR12","unstructured":"Asano, T., Kirkpatrick, D.G., Nakagawa, K., Watanabe, O.: \u00d5( $$\\surd $$ n)-space and polynomial-time algorithm for planar directed graph reachability. In: Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Part II, Budapest, Hungary, August 25\u201329, 2014, pp. 45\u201356 (2014)"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Vinodchandran, N.V.: Space complexity of the directed reachability problem over surface-embedded graphs. Technical report TR14-008, I (2014)","DOI":"10.1007\/978-3-319-05446-9_3"},{"key":"52_CR14","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"256","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","author":"S Kannan","year":"2008","unstructured":"Kannan, S., Khanna, S., Roy, S.: STCON in directed unique-path graphs. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), vol. 2, pp. 256\u2013267. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2008)"},{"key":"52_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-54458-5_61","volume-title":"Fundamentals of Computation Theory","author":"G Buntrock","year":"1991","unstructured":"Buntrock, G., Jenner, B., Lange, K.J., Rossmanith, P.: Unambiguity and fewness for logarithmic space. In: Budach, L. (ed.) Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 529, pp. 168\u2013179. Springer, Heidelberg (1991)"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Cook, S.: Deterministic CFL\u2019s are accepted simultaneously in polynomial time and log squared space. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 338\u2013345. ACM (1979)","DOI":"10.1145\/800135.804426"},{"issue":"5","key":"52_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s002240000102","volume":"31","author":"E Allender","year":"1998","unstructured":"Allender, E., Lange, K.: RUSPACE(log n) $$\\subseteq $$ DSPACE (log $${}^{\\text{2 }}$$ n \/ log log n). Theor. Comput. Syst. 31(5), 539\u2013550 (1998)","journal-title":"Theor. Comput. Syst."},{"key":"52_CR18","unstructured":"Nisan, N.: RL $$\\subseteq $$ SC. In: Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, pp. 619\u2013623 (1995)"},{"key":"52_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-73001-9_3","volume-title":"Computation and Logic in the Real World","author":"E Allender","year":"2007","unstructured":"Allender, E.: Reachability problems: an update. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 25\u201327. Springer, Heidelberg (2007)"},{"issue":"4","key":"52_CR20","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s00224-009-9172-z","volume":"45","author":"E Allender","year":"2009","unstructured":"Allender, E., Barrington, D.A.M., Chakraborty, T., Datta, S., Roy, S.: Planar and grid graph reachability problems. Theor. Comput. Syst. 45(4), 675\u2013723 (2009)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"52_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1490270.1490274","volume":"1","author":"C Bourke","year":"2009","unstructured":"Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theor. 1(1), 1\u201317 (2009)","journal-title":"ACM Trans. Comput. Theor."},{"key":"52_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19422-3_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Battista Di","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Upward drawings of acyclic digraphs. In: G\u00f6ttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol. 314. Springer, Heidelberg (1988)"},{"issue":"6","key":"52_CR23","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"GD Battista","year":"1990","unstructured":"Battista, G.D., Liu, W., Rival, I.: Bipartite graphs, upward drawings, and planarity. Inf. Process. Lett. 36(6), 317\u2013322 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"52_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: Upward planarity testing. Order 12(2), 109\u2013133 (1995). http:\/\/dx.doi.org\/10.1007\/BF01108622","journal-title":"Order"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:12:11Z","timestamp":1748704331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}