Abstract
Following the recent trends of designing space efficient algorithms for fundamental algorithmic graph problems, we present several time-space tradeoffs for performing Maximum Cardinality Search (MCS), Stack Breadth First Search (Stack BFS), and Queue Breadth First Search (Queue BFS) on a given input graph. As applications of these results, we also provide space-efficient implementations for testing if a given undirected graph is chordal, reporting an independent set, and a proper coloring of a given chordal graph among others. Finally, we also show how two other seemingly different graph problems and their algorithms have surprising connection with MCS with respect to designing space efficient algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We use \(\lg \) to denote logarithm to the base 2.
References
Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, New York (2009)
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–479 (2014)
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–564. Springer, Cham (2014). doi:10.1007/978-3-319-13075-0_44
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–130. Springer, Cham (2016). doi:10.1007/978-3-319-42634-1_10
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–360. Springer, Cham (2015). doi:10.1007/978-3-319-21398-9_28
Barnes, G., Buss, J., Ruzzo, W., Schieber, B.: A sublinear space, polynomial time algorithm for directed s-t connectivity. SICOMP 27(5), 1273–1282 (1998)
Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. CoRR cs.DS/0310049 (2003)
Berry, A., Krueger, R., Simonet, G.: Maximal label search algorithms to compute perfect and minimal elimination orderings. SIAM J. Discrete Math. 23(1), 428–446 (2009)
Chakraborty, S., Jo, S., Satti, S.R.: Improved space-efficient linear time algorithms for some classical graph problems. In: 15th CTW (2017)
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–22:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)
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–295. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44777-2_24
Edmonds, J., Poon, C.K., Achlioptas, D.: Tight lower bounds for st-connectivity on the NNJAG model. SIAM J. Comput. 28(6), 2257–2284 (1999)
Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math 15, 835–855 (1965)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs (2004)
Greenlaw, R.: A model classifying algorithms as inherently sequential with applications to graph searching. Inf. Comput. 97(2), 133–149 (1992)
Krueger, R., Simonet, G., Berry, A.: A general label search to investigate classical graph search algorithms. Discret. Appl. Math. 159(2–3), 128–142 (2011)
Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37–42. Springer, Heidelberg (1996). doi:10.1007/3-540-62034-6_35
Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315–323 (1980)
Panda, B.S.: New linear time algorithms for generating perfect elimination orderings of chordal graphs. Inf. Process. Lett. 58(3), 111–115 (1996)
Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 1–24 (2008)
Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266–283 (1976)
Tarjan, R.E.: Maximum cardinality search and chordal graphs. Unpublished Lecture Notes CS 259
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–579 (1984)
Tompa, M.: Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations. SIAM J. Comput. 11(1), 130–137 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Chakraborty, S., Satti, S.R. (2017). Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. In: Cao, Y., Chen, J. (eds) Computing and Combinatorics. COCOON 2017. Lecture Notes in Computer Science(), vol 10392. Springer, Cham. https://doi.org/10.1007/978-3-319-62389-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-62389-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62388-7
Online ISBN: 978-3-319-62389-4
eBook Packages: Computer ScienceComputer Science (R0)