Beate Bollig. Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. In Petr Hlinený, Antonín Kucera, editors, Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Volume 6281 of Lecture Notes in Computer Science, pages 186-197, Springer, 2010. [doi]
@inproceedings{Bollig10-2,
title = {Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks},
author = {Beate Bollig},
year = {2010},
doi = {10.1007/978-3-642-15155-2_18},
url = {http://dx.doi.org/10.1007/978-3-642-15155-2_18},
tags = {data-flow},
researchr = {https://researchr.org/publication/Bollig10-2},
cites = {0},
citedby = {0},
pages = {186-197},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings},
editor = {Petr Hlinený and Antonín Kucera},
volume = {6281},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-15154-5},
}