@InProceedings{chang_et_al:LIPIcs.STACS.2020.34,
author = {Chang, Yi-Jun and Farach-Colton, Mart{\'\i}n and Hsu, Tsan-Sheng and Tsai, Meng-Tsung},
title = {{Streaming Complexity of Spanning Tree Computation}},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
pages = {34:1--34:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-140-5},
ISSN = {1868-8969},
year = {2020},
volume = {154},
editor = {Paul, Christophe and Bl\"{a}ser, Markus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.34},
URN = {urn:nbn:de:0030-drops-118951},
doi = {10.4230/LIPIcs.STACS.2020.34},
annote = {Keywords: Max-Leaf Spanning Trees, BFS Trees, DFS Trees}
}