Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
  
Screen decoration graphicsLogo
Not Logged in. Login

Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs

Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano (2005) Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. In: Structural Information and Communication Complexity, 12th.

Full text not available from this repository.


Item Type:Conference or Workshop Item (Paper)
Subjects:UNSPECIFIED
ID Code:902
Deposited By:Dr Tomasz Radzik
Deposited On:08 Nov 2007 12:09
Last Modified:21 Nov 2007 13:16

Repository Staff Only: item control page
Accessibility  |   Terms and Conditions  |   Last Modified 01 November 2007
© 2007 DCS, King's College London, Strand, London WC2R 2LS, England, United Kingdom. Tel +44 (0)20 7836 5454