%0 Conference Paper %1 conf/cocoon/ChakrabortyS17 %A Chakraborty, Sankardeep %A Satti, Srinivasa Rao %B COCOON %D 2017 %E Cao, Yixin %E Chen, Jianer %I Springer %K dblp %P 87-98 %T Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. %U http://dblp.uni-trier.de/db/conf/cocoon/cocoon2017.html#ChakrabortyS17 %V 10392 %@ 978-3-319-62389-4

@inproceedings{conf/cocoon/ChakrabortyS17, added-at = {2017-07-25T00:00:00.000+0200}, author = {Chakraborty, Sankardeep and Satti, Srinivasa Rao}, biburl = {https://www.bibsonomy.org/bibtex/257561d5386bdbbb90cd34c3e76c1484d/dblp}, booktitle = {COCOON}, crossref = {conf/cocoon/2017}, editor = {Cao, Yixin and Chen, Jianer}, ee = {https://doi.org/10.1007/978-3-319-62389-4_8}, interhash = {493d0577b8498f9927612862bc1d0506}, intrahash = {57561d5386bdbbb90cd34c3e76c1484d}, isbn = {978-3-319-62389-4}, keywords = {dblp}, pages = {87-98}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:38:45.000+0200}, title = {Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications.}, url = {http://dblp.uni-trier.de/db/conf/cocoon/cocoon2017.html#ChakrabortyS17}, volume = 10392, year = 2017 }