251 search results - page 9 / 51 » Distributed algorithms for edge dominating sets |
90
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
108
click to vote
SMA
2008
ACM
14 years 9 months ago
2008
ACM
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges aligned to the principal directions of the underlying geome...
SMA
2008
ACM
14 years 9 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
81
Voted
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...