355 search results - page 34 / 71 » On Central Spanning Trees of a Graph |
ENDM
2010
14 years 10 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...
DM
2008
14 years 10 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
ESA
1998
Springer
15 years 2 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
106
click to vote
POPL
1993
ACM
15 years 1 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
ISBI
2004
IEEE
15 years 10 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...