632 search results - page 110 / 127 » On Routing in Circulant Graphs |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
111
click to vote
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
KI
2008
Springer
14 years 11 months ago
2008
Springer
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
115
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...