{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:10:11Z","timestamp":1742940611109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250263"},{"type":"electronic","value":"9783030250270"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25027-0_14","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:04:09Z","timestamp":1564617849000},"page":"201-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Space Efficient Algorithms for Breadth-Depth Search"],"prefix":"10.1007","author":[{"given":"Sankardeep","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anish","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-319-13075-0_44","volume-title":"Algorithms and Computation","author":"T Asano","year":"2014","unstructured":"Asano, T., et al.: Depth-first search using $$O(n)$$ bits. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 553\u2013564. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_44"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Banerjee, N., Chakraborty, S., Raman, V., Satti, S.R.: Space efficient linear time algorithms for BFS, DFS and applications. Theory Comput. Syst. (2018)","DOI":"10.1007\/s00224-017-9841-2"},{"key":"14_CR3","unstructured":"Banyassady, B., et al.: Improved time-space trade-offs for computing voronoi diagrams. In: 34th STACS, pp. 9:1\u20139:14 (2017)"},{"key":"14_CR4","unstructured":"Chakraborty, S.: Space efficient graph algorithms. Ph.D. thesis. The Institute of Mathematical Sciences, HBNI, India (2018)"},{"key":"14_CR5","unstructured":"Chakraborty, S., Jo, S., Satti, S.R.: Improved space-efficient linear time algorithms for some classical graph problems. CoRR, abs\/1712.03349 (2017)"},{"key":"14_CR6","unstructured":"Chakraborty, S., Mukherjee, A., Raman, V., Satti, S.R.: A framework for in-place graph algorithms. In: 26th ESA, pp. 13:1\u201313:16 (2018)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jcss.2017.06.006","volume":"90","author":"S Chakraborty","year":"2017","unstructured":"Chakraborty, S., Raman, V., Satti, S.R.: Biconnectivity, st-numbering and other applications of DFS using $${\\rm O}(n)$$ bits. J. Comput. Syst. Sci. 90, 63\u201379 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10878-018-0270-1","volume":"37","author":"S Chakraborty","year":"2018","unstructured":"Chakraborty, S., Satti, S.R.: Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. J. Comb. Optim. 37(2), 465\u2013481 (2018)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/050623498","volume":"22","author":"DG Corneil","year":"2008","unstructured":"Corneil, D.G., Krueger, R.: A unified view of graph searching. SIAM J. Discrete Math. 22(4), 1259\u20131276 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11682462_34","volume-title":"LATIN 2006: Theoretical Informatics","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., der Heide, F.M., Pagh, R., P\u01cetra\u015fcu, M.: De dictionariis dynamicis pauco spatio utentibus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 349\u2013361. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_34"},{"key":"14_CR11","unstructured":"Elmasry, A., Hagerup, T., Kammer, F.: Space-efficient basic graph algorithms. In: 32nd STACS, pp. 288\u2013301 (2015)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1142\/S0129626493000253","volume":"3","author":"R Greenlaw","year":"1993","unstructured":"Greenlaw, R.: Breadth-depth search is P-complete. Parallel Process. Lett. 3, 209\u2013222 (1993)","journal-title":"Parallel Process. Lett."},{"key":"14_CR13","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press (1978)"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(93)90011-W","volume":"45","author":"B Jiang","year":"1993","unstructured":"Jiang, B.: I\/O-and CPU-optimal recognition of strongly connected components. Inf. Process. Lett. 45(3), 111\u2013115 (1993)","journal-title":"Inf. Process. Lett."},{"key":"14_CR15","unstructured":"Kiyomi, M., Ono, H., Otachi, Y., Schweitzer, P., Tarui, J.: Space-efficient algorithms for longest increasing subsequence. In: 35th STACS, pp. 44:1\u201344:15 (2018)"},{"key":"14_CR16","unstructured":"Lincoln, A., Williams, V.V., Wang, J.R., Williams, R.R.: Deterministic time-space trade-offs for k-sum. In: 43rd ICALP, pp. 58:1\u201358:14 (2016)"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25027-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:25:19Z","timestamp":1710336319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25027-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250263","9783030250270"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25027-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/di.ku.dk\/fct2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}