384 search results - page 55 / 77 » On s-hamiltonian-connected line graphs |
ASPDAC
1995
ACM
14 years 5 days ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
CHI
1996
ACM
14 years 23 days ago
1996
ACM
Rapid growth in 3-D rendering technologies has deluged us with glitzy graphical representations. In what contexts do people find 3-D graphs of 2-D data both attractive and useful?...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
CCCG
1997
13 years 10 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...