3471 search results - page 325 / 695 » Obstacle Numbers of Graphs |
168
click to vote
CSL
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
169
click to vote
GD
2007
Springer
16 years 27 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
153
click to vote
SIBGRAPI
2006
IEEE
16 years 23 days ago
2006
IEEE
The single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in...
244
click to vote
ICCV
2005
IEEE
16 years 11 days ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
177
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...