Hardness and approximation results for black hole search in arbitrary graphs
KLASING, Ralf
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Voir plus >
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
KLASING, Ralf
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
< Réduire
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Langue
en
Communication dans un congrès
Ce document a été publié dans
Lecture Notes in Computer Science, Lecture Notes in Computer Science, Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), 2005-05. 2005-05, vol. 3499, p. 200--215
Origine
Importé de halUnités de recherche