34 search results - page 6 / 7 » Dependency Pairs and Polynomial Path Orders |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
ICALP
2005
Springer
14 years 29 days 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...
EJWCN
2010
13 years 2 months ago
2010
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
DEBS
2008
ACM
13 years 8 months ago
2008
ACM
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...