Navigation Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 par Discipline "Informatique [cs]/Mathématique discrète [cs.DM]"
Voici les éléments 1-20 de 27
-
Comment battre la marche aléatoire en comptant ?
Communication dans un congrès -
La structure des graphes sans mineur K 2,4
Communication dans un congrès -
Gathering radio messages in the path
(Discrete Mathematics, Algorithms and Applications. vol. 5, n° 1, pp. 1-28, 2013-03)Article de revue -
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring
Communication dans un congrès -
There are Plane Spanners of Maximum Degree 4 (extended abstract)
Communication dans un congrès -
Plane Spanners of Maximum Degree Six
Communication dans un congrès -
Path Separability of Graphs
(2010-08)Document de travail - Pré-publication -
On Compact Encoding of Pagenumber $k$ Graphs
(Discrete Mathematics and Theoretical Computer Science. vol. Vol. 10 no. 3, n° 3, pp. 23-34, 2008-01-01)Article de revue -
On the Locality of Distributed Sparse Spanner Construction
(2008)Autre document -
More Efficient Periodic Traversal in Anonymous Undirected Graphs
Communication dans un congrès -
Strong-Diameter Decompositions of Minor Free Graphs
Communication dans un congrès -
Short Labels by Traversal and Jumping
Communication dans un congrès -
[Sans titre]
Communication dans un congrès -
Localized and Compact Data-Structure for Comparability Graphs
(Discrete Mathematics. vol. 309, n° 11, pp. 3465-3484, 2009-06)Article de revue -
On the size of identifying codes in triangle-free graphs
(Discrete Applied Mathematics. vol. 160, n° 10-11, pp. 1532-1546, 2012-07-01)Article de revue -
Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models
Communication dans un congrès -
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Communication dans un congrès -
$k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Communication dans un congrès