277 search results - page 34 / 56 » The saga of minimum spanning trees |
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...
96
Voted
ORL
2008
15 years 21 days ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
100
Voted
ICPP
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
116
click to vote
STOC
1996
ACM
15 years 4 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
130
Voted
AINA
2005
IEEE
15 years 6 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...