3204 search results - page 186 / 641 » The Alcuin Number of a Graph |
SIBGRAPI
2006
IEEE
14 years 2 months 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...
ICCV
2005
IEEE
14 years 2 months 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...
GECCO
2003
Springer
14 years 1 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 ...
INFOVIS
2000
IEEE
14 years 23 days 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 ...
ATMOS
2010
13 years 7 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...