641 search results - page 40 / 129 » On Planar Quasi-Parity Graphs |
118
click to vote
JCO
1998
15 years 1 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
109
click to vote
GBRPR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Image segmentation has long been an important problem in the computer vision community. In our recent work we have addressed the problem of texture segmentation, where we...
114
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
132
click to vote
MOBIHOC
2001
ACM
16 years 1 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
134
click to vote
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...