355 search results - page 31 / 71 » On Central Spanning Trees of a Graph |
125
click to vote
NETWORKS
2006
15 years 19 days 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...
107
Voted
SODA
1994
ACM
15 years 2 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...
120
Voted
ALGORITHMICA
2010
15 years 25 days 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 ...
94
Voted
IADIS
2003
15 years 2 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...
103
click to vote
ICALP
2009
Springer
16 years 29 days 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...