265 search results - page 27 / 53 » The independence number in graphs of maximum degree three |
ADBIS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The last years there is an increasing interest for query processing techniques that take into consideration the dominance relationship between objects to select the most ...
PODC
2011
ACM
14 years 16 days ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
HAPTICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Knob turning is a common task that should influence the design of human-machine interfaces such as prosthetic arms, teleoperated robots, and virtual environments. This study exam...
143
click to vote
IWPEC
2010
Springer
14 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
JGAA
2006
14 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...