Nearly complete graphs decomposable into large induced matchings and their applications - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Noga Alon, Ankur Moitra, Benny Sudakov. Nearly complete graphs decomposable into large induced matchings and their applications. In Howard J. Karloff, Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012. pages 1079-1090, ACM, 2012. [doi]

This author has not been identified. Look up 'Noga Alon' in GoogleThis author has not been identified. Look up 'Ankur Moitra' in GoogleThis author has not been identified. Look up 'Benny Sudakov' in Google

runs on WebDSL