Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Sotiris E. Nikoletseas, Paul G. Spirakis. Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. In Jan van Leeuwen, editor, Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG 93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings. Volume 790 of Lecture Notes in Computer Science, pages 1-10, Springer, 1993.

This author has not been identified. Look up 'Sotiris E. Nikoletseas' in GoogleThis author has not been identified. Look up 'Paul G. Spirakis' in Google

runs on WebDSL