6740 search results - page 261 / 1348 » An s -Hamiltonian Line Graph Problem |
107
Voted
GD
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
127
click to vote
JCT
2008
15 years 23 days ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
116
Voted
CORR
2002
Springer
15 years 18 days ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
76
Voted
DM
2008
15 years 10 days ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
214
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...