40 search results - page 7 / 8 » Using a Significant Spanning Tree to Draw a Directed Graph |
SIGMOD
2009
ACM
14 years 7 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...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
STOC
1996
ACM
13 years 11 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...
BMCBI
2010
13 years 7 months ago
2010
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
BIOCOMP
2006
13 years 8 months ago
2006
- The search for structural similarity among proteins can provide valuable insights into their functional mechanisms and their functional relationships. Though the protein 1D seque...