Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco. Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. In Andrzej Pelc, Michel Raynal, editors, Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings. Volume 3499 of Lecture Notes in Computer Science, pages 200-215, Springer, 2005. [doi]

This author has not been identified. Look up 'Ralf Klasing' in GoogleThis author has not been identified. Look up 'Euripides Markou' in GoogleThis author has not been identified. Look up 'Tomasz Radzik' in GoogleThis author has not been identified. Look up 'Fabiano Sarracco' in Google

runs on WebDSL