Routage compact optimal dans les $(k,r)$-constellations
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | DIENG, Youssou | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| hal.structure.identifier | Institut universitaire de France [IUF] | |
| dc.contributor.author | GAVOILLE, Cyril | |
| dc.date.accessioned | 2024-04-15T09:46:18Z | |
| dc.date.available | 2024-04-15T09:46:18Z | |
| dc.date.issued | 2011-05 | |
| dc.identifier.issn | 0752-4072 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197992 | |
| dc.description.abstractEn | \cite{FG01a} and independently \cite{TZ01} show that $n$-node trees support routing schemes with message headers, node addresses, and routing tables of $O(\log n)$ bits. It still open to known if this optimal result can be extended to the tree-width two graphs. The best known routing scheme require $O(\log^2n)$ bits (cf.~\cite{Peleg00a}). In this article, we extend this optimal result to \emph{$(k,r)$-constellations}, i.e., $K_{2,r}$-minor free networks whose bi-connected components are outerplanar by deleting $k$ vertices. For example, $(2,4)$-constellations contain trees, outerplanars and more generally all $K_{2,4}$-minor free networks. | |
| dc.language.iso | fr | |
| dc.publisher | Lavoisier | |
| dc.subject.en | compact routing | |
| dc.subject.en | free-minor graph | |
| dc.subject.en | planar graph | |
| dc.subject.en | outerplanar graph | |
| dc.title | Routage compact optimal dans les $(k,r)$-constellations | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.3166/TSI.30.485-513 | |
| dc.subject.hal | Informatique [cs]/Algorithme et structure de données [cs.DS] | |
| bordeaux.journal | Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques | |
| bordeaux.page | 485-513 | |
| bordeaux.volume | 30 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.issue | 05/2011 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00651841 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00651841v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.title=Routage%20compact%20optimal%20dans%20les%20$(k,r)$-constellations&rft.atitle=Routage%20compact%20optimal%20dans%20les%20$(k,r)$-constellations&rft.jtitle=Revue%20des%20Sciences%20et%20Technologies%20de%20l'Information%20-%20S%C3%A9rie%20TSI%20:%20Technique%20et%20Science%20Informatiques&rft.date=2011-05&rft.volume=30&rft.issue=05/2011&rft.spage=485-513&rft.epage=485-513&rft.eissn=0752-4072&rft.issn=0752-4072&rft.au=DIENG,%20Youssou&GAVOILLE,%20Cyril&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||