110 search results - page 10 / 22 » Minimum Bounded Degree Spanning Trees |
ICALP
2004
Springer
14 years 26 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
JUCS
2007
13 years 7 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
SIAMDM
2010
13 years 2 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
PATMOS
2004
Springer
14 years 25 days ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
ICPP
2005
IEEE
14 years 1 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...