1729 search results - page 259 / 346 » On Bounds for the k-Partitioning of Graphs |
DM
2007
14 years 10 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
ENDM
2007
14 years 10 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
TCS
2008
14 years 10 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
FCT
2009
Springer
15 years 4 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...