Recherche
-
Searching for black-hole faults in a network using multiple agents
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 -
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
(Springer-Verlag, 2005)Ouvrage -
Algorithmic Methods for Large Communication Networks
Autre document -
Dissemination of Information in Optical Networks
(Springer-Verlag, 2008)Ouvrage -
Constructing Incremental Sequences in Graphs
(Algorithmic Operations Research. vol. 1, n° 2, pp. 1--7, 2006)Article de revue -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Communication dans un congrès -
On k-Connectivity Problems with Sharpened Triangle Inequality
(Journal of Discrete Algorithms. vol. 6, n° 4, pp. 605--617, 2008)Article de revue -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
(Theoretical Computer Science. vol. 326, n° 1--3, pp. 137--153, 2004-10)Article de revue -
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract)
Communication dans un congrès