International audienceComputing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Har
We consider the problem of discovering properties (such as the diameter) of an unknown network G = (...
In classical network reliability analysis, the system under study is a net-work with perfect nodes b...
Soit un réseau comprenant des lignes de communication qui échouent indépendamment, dans lequel tous ...
International audienceComputing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Har
10.1145/2935764.2935781Annual ACM Symposium on Parallelism in Algorithms and Architectures11-13-July...
International audienceA nonsplit graph is a directed graph where each pair of nodes has a common inc...
Communication speed in a parallel and distributed system is related to the diameter of its underlyin...
The network approach to computation is more direct and \physical" than the one based on some s...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
We revisit the hardness of approximating the diameter of a network. In the CONGEST model, $ \tilde \...
The computational efficiency and computational complexity of different networks.</p
Finding strongly connected components (SCCs) and the diameter of a directed network play a key role ...
We consider how a set of collaborating agents can distributedly infer some of the properties of the ...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
Soit un réseau comprenant des lignes de communication qui échouent indépendamment, dans lequel tous ...
We consider the problem of discovering properties (such as the diameter) of an unknown network G = (...
In classical network reliability analysis, the system under study is a net-work with perfect nodes b...
Soit un réseau comprenant des lignes de communication qui échouent indépendamment, dans lequel tous ...
International audienceComputing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Har
10.1145/2935764.2935781Annual ACM Symposium on Parallelism in Algorithms and Architectures11-13-July...
International audienceA nonsplit graph is a directed graph where each pair of nodes has a common inc...
Communication speed in a parallel and distributed system is related to the diameter of its underlyin...
The network approach to computation is more direct and \physical" than the one based on some s...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
We revisit the hardness of approximating the diameter of a network. In the CONGEST model, $ \tilde \...
The computational efficiency and computational complexity of different networks.</p
Finding strongly connected components (SCCs) and the diameter of a directed network play a key role ...
We consider how a set of collaborating agents can distributedly infer some of the properties of the ...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
Soit un réseau comprenant des lignes de communication qui échouent indépendamment, dans lequel tous ...
We consider the problem of discovering properties (such as the diameter) of an unknown network G = (...
In classical network reliability analysis, the system under study is a net-work with perfect nodes b...
Soit un réseau comprenant des lignes de communication qui échouent indépendamment, dans lequel tous ...
DOI
Add to ORKG