601 search results - page 44 / 121 » Edge-dominating cycles in graphs |
SIAMDM
2010
13 years 3 months ago
2010
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at
COCOON
2010
Springer
13 years 7 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
PAMI
2002
13 years 8 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...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...