5889 search results - page 360 / 1178 » Graph Layout Problems |
203
Voted
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
170
click to vote
CVPR
2004
IEEE
16 years 8 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...
224
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
138
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
170
click to vote
MFCS
2007
Springer
16 years 28 days ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...