335 search results - page 13 / 67 » How to Use Spanning Trees to Navigate in Graphs |
182
click to vote
ISBI
2004
IEEE
16 years 6 months ago
2004
IEEE
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
159
click to vote
SODA
1994
ACM
15 years 7 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
166
click to vote
APWEB
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
164
click to vote
JCT
2008
15 years 6 months ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
178
click to vote
ENDM
2010
15 years 6 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...