241 search results - page 15 / 49 » Degree Bounded Spanning Trees |
ICALP
2004
Springer
15 years 5 months 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 ...
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
SODA
2007
ACM
15 years 1 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
SWAT
1990
Springer
15 years 3 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...