1798 search results - page 9 / 360 » A Tree for All Seasons |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
COCOC
1995
15 years 1 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
106
Voted
TALG
2008
14 years 9 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
116
click to vote
INFOCOM
1997
IEEE
15 years 1 months ago
1997
IEEE
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
IGARSS
2009
14 years 7 months ago
2009
This study used remotely-sensed phenology data derived from Advanced Very High Resolution Radiometer (AVHRR), in a fully supervised decision-tree classification based on the new b...