328 search results - page 15 / 66 » Algorithms for the edge-width of an embedded graph |
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
COMBINATORICA
2008
14 years 8 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
ARSCOM
2002
14 years 9 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
RSA
2008
14 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...