3019 search results - page 78 / 604 » Approximating the Domatic Number |
109
click to vote
WG
2007
Springer
15 years 6 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
ICDT
1995
ACM
15 years 3 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
108
click to vote
ESA
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
266
click to vote
COCOON
2011
Springer
13 years 11 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...