197 search results - page 10 / 40 » Some Topological Methods in Graph Coloring Theory |
BMCBI
2006
13 years 8 months ago
2006
Background: Tangle analysis has been applied successfully to study proteins which bind two segments of DNA and can knot and link circular DNA. We show how tangle analysis can be e...
TIT
1998
13 years 8 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Mean shift is a popular method to segment images and videos. Pixels are represented by feature points, and the segmentation is driven by the point density in feature space. In thi...
DAM
2008
13 years 8 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
LION
2009
Springer
14 years 3 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...