Yangjun Chen, Yibin Chen. Decomposing DAGs into spanning trees: A new way to compress transitive closures. In Serge Abiteboul, Klemens Böhm, Christoph Koch, Kian-Lee Tan, editors, Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11-16, 2011, Hannover, Germany. pages 1007-1018, IEEE Computer Society, 2011. [doi]
@inproceedings{ChenC11-12,
title = {Decomposing DAGs into spanning trees: A new way to compress transitive closures},
author = {Yangjun Chen and Yibin Chen},
year = {2011},
doi = {10.1109/ICDE.2011.5767832},
url = {http://dx.doi.org/10.1109/ICDE.2011.5767832},
researchr = {https://researchr.org/publication/ChenC11-12},
cites = {0},
citedby = {0},
pages = {1007-1018},
booktitle = {Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11-16, 2011, Hannover, Germany},
editor = {Serge Abiteboul and Klemens Böhm and Christoph Koch and Kian-Lee Tan},
publisher = {IEEE Computer Society},
isbn = {978-1-4244-8958-9},
}