An optimal parallel algorithm for computing cut vertices and blocks on interval graphs.
Madhumangal PalSukumar MondalDebashis BeraTapan Kumar PalPublished in: Int. J. Comput. Math. (2000)
Keyphrases
- parallel algorithm
- binary search trees
- planar graphs
- parallel computation
- vertex set
- parallel programming
- medial axis transform
- dynamic programming
- parallel version
- weighted graph
- shared memory
- parallel implementations
- undirected graph
- random graphs
- attributed graphs
- cluster of workstations
- search algorithm
- graph structure
- directed graph
- labeled graphs
- binary images
- data structure