6740 search results - page 21 / 1348 » An s -Hamiltonian Line Graph Problem |
154
Voted
VMV
2008
15 years 6 months ago
2008
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
153
click to vote
IBIS
2006
15 years 4 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
160
Voted
SOFSEM
2005
Springer
15 years 10 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
127
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
153
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...