803 search results - page 71 / 161 » Independence in Direct-Product Graphs |
115
Voted
HASE
1999
IEEE
15 years 5 months ago
1999
IEEE
The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend...
128
Voted
ESAS
2006
Springer
15 years 4 months ago
2006
Springer
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
107
Voted
CCCG
2008
15 years 2 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
130
click to vote
ALGORITHMICA
2008
15 years 26 days ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
110
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...