Evènement pour le groupe

**Algorithmique Distribuée**
Date | 2014-05-05 14:00-15:00 |

Titre | Data Structures for Emergency Planning |

Résumé | We present in this talk different techniques for quickly answer graph problems where some of the nodes may be turn off. Typical graph problems are such as connectivity or distances between pair of nodes but not only. Emergency planning for such problems is achieved by pre-processing the graphs and by virtually preventing all possible subsequent node removals. To obtain efficient data structures, the idea is to attach very little and localized information to nodes of the input graph so that queries can be solved using solely on these information. Contexts and solutions for several problems will be surveyed. |

Lieu | 178 |

Orateur | Cyril Gavoille |

Aucun document lié à cet événement.

RetourRetour à l'index