On the Query Complexity of Testing Orientations for Being Eulerian - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom. On the Query Complexity of Testing Orientations for Being Eulerian. In Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld, editors, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings. Volume 5171 of Lecture Notes in Computer Science, pages 402-415, Springer, 2008. [doi]

This author has not been identified. Look up 'Eldar Fischer' in GoogleThis author has not been identified. Look up 'Oded Lachish' in GoogleThis author has not been identified. Look up 'Ilan Newman' in GoogleThis author has not been identified. Look up 'Arie Matsliah' in GoogleThis author has not been identified. Look up 'Orly Yahalom' in Google

runs on WebDSL