351 search results - page 32 / 71 » An exact method for graph coloring |
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
APVIS
2008
13 years 9 months ago
2008
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks...
ICPR
2010
IEEE
14 years 1 months ago
2010
IEEE
We propose a novel Markovian segmentation
model which takes into account edge information. By construction,
the model uses only pairwise interactions and its
energy is submodula...
JCT
2010
13 years 6 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...