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.
CITATION STYLE
Chakraborty, S., & Satti, S. R. (2017). Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10392 LNCS, pp. 87–98). Springer Verlag. https://doi.org/10.1007/978-3-319-62389-4_8
Mendeley helps you to discover research relevant for your work.