599 search results - page 18 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
100
click to vote
ICTAI
2006
IEEE
15 years 5 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
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...
AAAI
2007
15 years 1 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
119
Voted
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...