599 search results - page 93 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
116
Voted
DAM
2011
14 years 9 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
121
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
108
Voted
ICIP
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper describes a new framework for the automated tracking of the central retinal vein in retinal images. The procedure first computes a binary image of the retinal vasculatur...
112
click to vote
COLT
2004
Springer
15 years 8 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
134
click to vote
PODC
2011
ACM
14 years 5 months 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...