@InProceedings{chakraborty_et_al:LIPIcs.ISAAC.2016.22,
author = {Chakraborty, Sankardeep and Raman, Venkatesh and Satti, Srinivasa Rao},
title = {{Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.22},
URN = {urn:nbn:de:0030-drops-67927},
doi = {10.4230/LIPIcs.ISAAC.2016.22},
annote = {Keywords: biconnectivity, st-number, chain decomposition, tree cover, space efficient algorithms, read-only memory}
}