Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800: Dépôts récents
Voici les éléments 261-280 de 1768
-
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract)
Communication dans un congrès -
Improved approximation results for the Minimum Energy Broadcasting problem in Wireless Ad Hoc Networks
(Algorithmica. vol. 49, n° 4, pp. 318--336, 2007-12)Article de revue -
Improved approximation results for the Minimum Energy Broadcasting Problem
Communication dans un congrès -
Tightening the upper bound for the Minimum Energy Broadcasting
(Wireless Networks. vol. 14, n° 5, pp. 659--669, 2008)Article de revue -
Dominating Sets in Web Graphs
Communication dans un congrès -
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
(Internet Mathematics. vol. 2, n° 3, pp. 275--300, 2005)Article de revue -
Searching for black-hole faults in a network using multiple agents
Communication dans un congrès -
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
(Springer-Verlag, 2005)Ouvrage -
Non-searchability of random power-law graphs
Communication dans un congrès -
Towards Small World Emergence
Communication dans un congrès -
Could any graph be turned into a small-world?
(Theoretical Computer Science. vol. 355, pp. 96--103, 2006)Article de revue -
From Balls and Bins to Points and Vertices
Communication dans un congrès -
Approximation bounds for Black Hole Search problems
Communication dans un congrès -
Hardness and approximation results for black hole search in arbitrary graphs
Communication dans un congrès -
Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem
Communication dans un congrès -
Hardness results and approximation algorithms of k-tuple domination in graphs
(Information Processing Letters. vol. 89, n° 2, pp. 75--83, 2004-01)Article de revue -
Hardness and approximation results for black hole search in arbitrary graphs
(Theoretical Computer Science. vol. 384, n° 2-3, pp. 201-221, 2007-10)Article de revue -
Gathering asynchronous oblivious mobile robots in a ring
Communication dans un congrès -
Cost minimisation in multi-interface networks
Communication dans un congrès -
Gathering asynchronous oblivious mobile robots in a ring
(Theoretical Computer Science. vol. 390, n° 1, pp. 27--39, 2008-01)Article de revue