599 search results - page 72 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
138
Voted
WG
2009
Springer
15 years 9 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
133
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
116
Voted
COMBINATORICA
2007
15 years 2 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
129
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
139
Voted
IM
2007
15 years 2 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...