Abstract
We provide a new paradigm to treat insertion and deletion of a batch of edges in a graph, that makes use of the sparsification technique developed for on-line algorithms. In particular, we refer to the problems of minimal spanning forest (MSF), connected components (CC) and k-vertex-connectivity (k-VC). Our batch algorithms, improve of a log-factor over the classical one-by-one algorithms, for k- VC. This improvement is limited to batches of properly “large” size for MSF and CC. In parallel computation we discuss MSF and CC under single edge updating, batch insertions and batch updating, extending the use of the sparsification data structure 10 the CRCVV PRAM model and providing efficient parallel algorithms for these problems (the batch algorithms for CC are indeed work-optimal). We also discuss the difficulty of obtaining a parallel dynamic algorithm for the k-vertex connectivity problem.KeywordsParallel AlgorithmMinimum Span TreeDynamic AlgorithmEdge InsertionSparsification TreeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
