Afficher la notice abrégée

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierInstitut universitaire de France [IUF]
dc.contributor.authorGAVOILLE, Cyril
dc.date.accessioned2024-04-15T09:45:52Z
dc.date.available2024-04-15T09:45:52Z
dc.date.conference2011-12-12
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/197956
dc.description.abstractEnForbidden-set labeling schemes is a way to associate with each node of a graph G a compact data-structure, i.e., a short label, supporting queries Q(s,t,X) between any two nodes (s,t) of G\X where X is any set of "forbidden" nodes of G. The query Q(s,t,X) must be solved from the labels of the nodes involved in the query only, without any other source of information. Several important distributed applications are captured by this framework, like for instance fault-tolerant and policy routing in the Internet. In this talk, I show how to derive new time-efficient algorithms for some problems in dynamic graphs.
dc.language.isoen
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleFirst International Workshop on Dynamic Systems (DYNAM)
bordeaux.countryFR
bordeaux.conference.cityToulouse
bordeaux.peerReviewedoui
hal.identifierhal-00656916
hal.version1
hal.invitedoui
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00656916v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=GAVOILLE,%20Cyril&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée