3757 search results - page 232 / 752 » The overlap number of a graph |
170
click to vote
DM
2011
15 years 1 months ago
2011
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted ...
208
click to vote
SBBD
2004
15 years 8 months ago
2004
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
174
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
222
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
259
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...