355 search results - page 31 / 71 » On Central Spanning Trees of a Graph |
NETWORKS
2006
14 years 9 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
SODA
1994
ACM
14 years 11 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...
ALGORITHMICA
2010
14 years 10 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
IADIS
2003
14 years 11 months ago
2003
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...