4171 search results - page 334 / 835 » Choice numbers of graphs |
174
Voted
GD
2007
Springer
16 years 1 months 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...
155
Voted
SIBGRAPI
2006
IEEE
16 years 26 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...
251
Voted
ICCV
2005
IEEE
16 years 14 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...
179
click to vote
GECCO
2003
Springer
16 years 2 days 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 ...
169
Voted
INFOVIS
2000
IEEE
15 years 11 months ago
2000
IEEE
We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV’s only assumption is that the vertex set of the underlying digraph ...