An improved lower bound on identifying compelled edges in a DAG - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'D. Wu' in Google

runs on WebDSL