Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,365
Maintaining minimum spanning forests in dynamic graphs
- SIAM J. COMPUT
, 2001
"... We present the first fully dynamicalgorithm for maintaining a minimum spanning forest in time o ( √ n) per operation. To be precise, the algorithm uses O(n 1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
We present the first fully dynamicalgorithm for maintaining a minimum spanning forest in time o ( √ n) per operation. To be precise, the algorithm uses O(n 1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle
- IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2009
"... We study the watersheds in edge-weighted graphs. We define the watershed cuts following the intuitive idea of drops of water flowing on a topographic surface. We first establish the consistency of these watersheds: they can be equivalently defined by their “catchment basins” (through a steepest des ..."
Abstract
-
Cited by 49 (23 self)
- Add to MetaCart
descent property) or by the “dividing lines ” separating these catchment basins (through the drop of water principle). Then we prove, through an equivalence theorem, their optimality in terms of minimum spanning forests. Afterward, we introduce a linear-time algorithm to compute them. To the best of our
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
- In PPoPP ’09: Proceedings of the 14th ACM SIGPLAN Symposium on Principles
"... Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising as a new paradigm to pursue. However, to fully exploit all the cores in a chip, parallel programming is often required, a ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
to assist in the design of efficient Transactional Memory algorithms and a novel Transactional Memory algorithm for computing a minimum spanning forest of sparse graphs. We emphasize multiple Transactional Memory related design issues in presenting our algorithm. We also provide experimental results
Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs
, 2003
"... Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent problems in biology and medicine such as cancer detection, medical imaging, and proteomics, and national security and bio ..."
Abstract
- Add to MetaCart
we design and implement four parallel MST algorithms (three variations of Bor˚uvka plus our new approach) for arbitrary sparse graphs that for the first time give speedup when compared with the best sequential algorithm. In fact, our algorithms also solve the minimum spanning forest problem. We
Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs
, 2006
"... ..."
Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts
, 2011
"... ..."
A randomized time-work optimal parallel algorithm for finding a minimum spanning forest
- SIAM J. COMPUT
, 1999
"... We present a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an exclusive read exclusive write (EREW) PRAM. This result is optimal w.r.t. both work and parallel time, and is the fi ..."
Abstract
-
Cited by 20 (3 self)
- Add to MetaCart
We present a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an exclusive read exclusive write (EREW) PRAM. This result is optimal w.r.t. both work and parallel time
Results 1 - 10
of
4,365
