388 search results - page 22 / 78 » An approximate algorithm for median graph computation using ... |
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
ICMS
2010
13 years 6 months ago
2010
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...