2283 search results - page 182 / 457 » Bounds of Graph Characteristics |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
DM
2008
13 years 8 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
JGT
2006
13 years 8 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
JNW
2007
13 years 8 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...