384 search results - page 33 / 77 » On s-hamiltonian-connected line graphs |
COMPGEOM
1992
ACM
14 years 22 days ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
CCCG
2007
13 years 10 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
AAAI
2008
13 years 11 months ago
2008
Traditional artificial intelligence techniques do not perform well in applications such as real-time strategy games because of the extensive search spaces which need to be explore...
DAS
2010
Springer
13 years 12 months ago
2010
Springer
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
JGAA
2007
13 years 8 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...