{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:44:40Z","timestamp":1743057880464,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623887"},{"type":"electronic","value":"9783319623894"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_8","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"87-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications"],"prefix":"10.1007","author":[{"given":"Sankardeep","family":"Chakraborty","sequence":"first","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":[[2017,7,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity - A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, New York (2009)"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.comgeo.2013.11.004","volume":"47","author":"T Asano","year":"2014","unstructured":"Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rote, G., Schulz, A.: Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. 47(3), 469\u2013479 (2014)","journal-title":"Comput. Geom."},{"key":"8_CR3","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). doi:10.1007\/978-3-319-13075-0_44"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-42634-1_10","volume-title":"Computing and Combinatorics","author":"N Banerjee","year":"2016","unstructured":"Banerjee, N., Chakraborty, S., Raman, V.: Improved space efficient algorithms for BFS, DFS and applications. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 9797, pp. 119\u2013130. Springer, Cham (2016). doi:10.1007\/978-3-319-42634-1_10"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-319-21398-9_28","volume-title":"Computing and Combinatorics","author":"N Banerjee","year":"2015","unstructured":"Banerjee, N., Chakraborty, S., Raman, V., Roy, S., Saurabh, S.: Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 349\u2013360. Springer, Cham (2015). doi:10.1007\/978-3-319-21398-9_28"},{"issue":"5","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1137\/S0097539793283151","volume":"27","author":"G Barnes","year":"1998","unstructured":"Barnes, G., Buss, J., Ruzzo, W., Schieber, B.: A sublinear space, polynomial time algorithm for directed s-t connectivity. SICOMP 27(5), 1273\u20131282 (1998)","journal-title":"SICOMP"},{"key":"8_CR7","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1137\/070684355","volume":"23","author":"A Berry","year":"2009","unstructured":"Berry, A., Krueger, R., Simonet, G.: Maximal label search algorithms to compute perfect and minimal elimination orderings. SIAM J. Discrete Math. 23(1), 428\u2013446 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR9","unstructured":"Chakraborty, S., Jo, S., Satti, S.R.: Improved space-efficient linear time algorithms for some classical graph problems. In: 15th CTW (2017)"},{"key":"8_CR10","unstructured":"Chakraborty, S., Raman, V., Satti, S.R.: Biconnectivity, chain decomposition and st-numbering using O(n) bits. In: 27th ISAAC, vol. 64. LIPIcs, pp. 22:1\u201322:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-662-44777-2_24","volume-title":"Algorithms - ESA 2014","author":"O Darwish","year":"2014","unstructured":"Darwish, O., Elmasry, A.: Optimal time-space tradeoff for the 2D convex-hull problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 284\u2013295. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44777-2_24"},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1137\/S0097539795295948","volume":"28","author":"J Edmonds","year":"1999","unstructured":"Edmonds, J., Poon, C.K., Achlioptas, D.: Tight lower bounds for st-connectivity on the NNJAG model. SIAM J. Comput. 28(6), 2257\u20132284 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math 15, 835\u2013855 (1965)","journal-title":"Pacific J. Math"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0890-5401(92)90033-C","volume":"97","author":"R Greenlaw","year":"1992","unstructured":"Greenlaw, R.: A model classifying algorithms as inherently sequential with applications to graph searching. Inf. Comput. 97(2), 133\u2013149 (1992)","journal-title":"Inf. Comput."},{"issue":"2\u20133","key":"8_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.dam.2010.02.011","volume":"159","author":"R Krueger","year":"2011","unstructured":"Krueger, R., Simonet, G., Berry, A.: A general label search to investigate classical graph search algorithms. Discret. Appl. Math. 159(2\u20133), 128\u2013142 (2011)","journal-title":"Discret. Appl. Math."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"JI Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37\u201342. Springer, Heidelberg (1996). doi:10.1007\/3-540-62034-6_35"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"JI Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315\u2013323 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(96)00013-0","volume":"58","author":"BS Panda","year":"1996","unstructured":"Panda, B.S.: New linear time algorithms for generating perfect elimination orderings of chordal graphs. Inf. Process. Lett. 58(3), 111\u2013115 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"8_CR20","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"},{"issue":"2","key":"8_CR21","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"8_CR22","unstructured":"Tarjan, R.E.: Maximum cardinality search and chordal graphs. Unpublished Lecture Notes CS 259"},{"issue":"3","key":"8_CR23","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."},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1137\/0211010","volume":"11","author":"M Tompa","year":"1982","unstructured":"Tompa, M.: Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations. SIAM J. Comput. 11(1), 130\u2013137 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62389-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:23:05Z","timestamp":1709810585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}