134 search results - page 21 / 27 » An Heuristic for the Construction of Intersection Graphs |
COMSWARE
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
116
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
101
click to vote
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
81
Voted
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...