6740 search results - page 18 / 1348 » An s -Hamiltonian Line Graph Problem |
GD
2007
Springer
14 years 1 months ago
2007
Springer
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
CCCG
2010
13 years 9 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
ASUNAM
2011
IEEE
12 years 7 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
SODA
2003
ACM
13 years 9 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...
ISPAN
2005
IEEE
14 years 1 months ago
2005
IEEE
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...