Characterization of efficiently parallel solvable problems on distance-hereditary graphs

Sun Yuan Hsieh, Chin Wen Ho, Tsan Sheng Hsu, Ming Tat Ko, Gen Huey Chen

研究成果: 雜誌貢獻期刊論文同行評審

7 引文 斯高帕斯(Scopus)

摘要

In this paper, we sketch common properties of a class of so-called subgraph optimization problems that can be systematically solved on distance-hereditary graphs. Based on the found properties, we then develop a general problem-solving paradigm that solves these problems efficiently in parallel. As a by-product, we also obtain new linear-time algorithms by a sequential simulation of our parallel algorithms. Let Td(|V|, |E|) and Pd(|V|, |E|) denote the time and processor complexities, respectively, required to construct a decomposition tree of a distance-hereditary graph G = (V, E) on a PRAM model Md. Based on the proposed paradigm, we show that the maximum independent set problem, the maximum clique problem, the vertex connectivity problem, the domination problem, and the independent domination problem can be sequentially solved in O(|V| + |E|) time, and solved in parallel in O(Td(|V|, |E|) + log |V|) time using O(Pd(|V|, |E|) + |V|/log |V|) processors on Md. By constructing a decomposition tree under a CREW PRAM, we also show that Td(|V|, |E|) = O(log2 |V|) and Pd(|V|, |E|) = O(|V| + |E|).

原文???core.languages.en_GB???
頁(從 - 到)488-518
頁數31
期刊SIAM Journal on Discrete Mathematics
15
發行號4
DOIs
出版狀態已出版 - 7月 2002

指紋

深入研究「Characterization of efficiently parallel solvable problems on distance-hereditary graphs」主題。共同形成了獨特的指紋。

引用此