Sciweavers

966 search results - page 68 / 194
» Small Alliances in Graphs
Sort
View
ESAS
2006
Springer
14 years 12 days ago
On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks
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 ...
Subhas Kumar Ghosh
SIROCCO
2008
13 years 10 months ago
Centralized Communication in Radio Networks with Strong Interference
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
Frantisek Galcík
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 8 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
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...
Gregory Gutin, Stefan Szeider, Anders Yeo
NJC
2006
88views more  NJC 2006»
13 years 8 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg