7 search results - page 2 / 2 » A Distributed Algorithm for Finding All Best Swap Edges of a... |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...