Sciweavers

1798 search results - page 9 / 360
» A Tree for All Seasons
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
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....
Sven Venema, Hong Shen, Francis Suraweera
COCOC
1995
150views Combinatorics» more  COCOC 1995»
13 years 11 months ago
On Central Spanning Trees of a Graph
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...
Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke
TALG
2008
131views more  TALG 2008»
13 years 7 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
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...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
INFOCOM
1997
IEEE
13 years 11 months ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
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...
Ehud Aharoni, Reuven Cohen
IGARSS
2009
13 years 5 months ago
Remotely Sensed Phenology for Mapping Biomes and Vegetation Functional Types
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...
Konrad J. Wessels, Karen Steenkamp, Graham Von Mal...