6740 search results - page 437 / 1348 » An s -Hamiltonian Line Graph Problem |
185
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
175
click to vote
ICIAR
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
155
click to vote
INFOVIS
2005
IEEE
16 years 11 days ago
2005
IEEE
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
173
click to vote
GD
2004
Springer
16 years 5 days ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
167
click to vote
ICCV
2003
IEEE
16 years 2 days ago
2003
IEEE
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...