6740 search results - page 78 / 1348 » An s -Hamiltonian Line Graph Problem |
GD
2008
Springer
13 years 11 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
PPL
2007
13 years 9 months ago
2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
PAMI
2002
13 years 9 months ago
2002
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
CG
2004
Springer
13 years 10 months ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...