D. Wu. An improved lower bound on identifying compelled edges in a DAG. In Boris Kovalerchuk, editor, Proceedings of the Second IASTED International Conference on Computational Intelligence, San Francisco, California, USA, November 20-22, 2006. pages 301-306, IASTED/ACTA Press, 2006.
@inproceedings{Wu06:14,
title = {An improved lower bound on identifying compelled edges in a DAG},
author = {D. Wu},
year = {2006},
researchr = {https://researchr.org/publication/Wu06%3A14},
cites = {0},
citedby = {0},
pages = {301-306},
booktitle = {Proceedings of the Second IASTED International Conference on Computational Intelligence, San Francisco, California, USA, November 20-22, 2006},
editor = {Boris Kovalerchuk},
publisher = {IASTED/ACTA Press},
isbn = {0-88986-603-1},
}