Distance hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. In this paper, we study properties of distance hereditary graphs from the view point of parallel computations. We present efficient parallel algorithms for finding a minimum weighted connected dominating set, a minimum weighted Steiner tree, which take O(log n) time using O(n + m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of a given graph, respectively. We also find a maximum weighted clique of a distance hereditary graph in O(log2 n) time using O(n + m) processors on a CREW PRAM.
|頁（從 - 到）||43-52|
|期刊||Parallel Processing Letters|
|出版狀態||Published - 1999 一月 1|
All Science Journal Classification (ASJC) codes