362 search results - page 30 / 73 » A Branch-and-Cut algorithm for graph coloring |
GD
2006
Springer
13 years 11 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
ICCI
1991
13 years 11 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
ESANN
2001
13 years 9 months ago
2001
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
ISAAC
2005
Springer
14 years 1 months 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...