頁籤選單縮合
題 名 | A Parallel Maximal Cliques Algorithm for Interval Graphs with Applications |
---|---|
作 者 | 王吉仕; 張瑞雄; | 書刊名 | Journal of Information Science and Engineering |
卷 期 | 13:4 1997.12[民86.12] |
頁 次 | 頁649-663 |
分類號 | 310.15 |
關鍵詞 | Parallel algorithms; Interval graphs; Maximal cliques; All-pair shortest path problem; |
語 文 | 英文(English) |
英文摘要 | In this paper, a simple parallel algorithm for finding all the maximal cliques of an interval graph is proposed. This algorithm can be implemented in parallel in O(log n) time using O(n �/ long n) processors. The maximal cliques of an interval graph contain important structural information. Many problems on interval graphs can be solved after all the maximal cliques are known. It is shown that cut vertices, bridges, vertex connectivities, and vertex-disjoint paths can all be determined easily after the maximal cliques are known. Finally, the all-pair shortest path problem for interval graphs is solved based on the relationship between maximal cliques. The all-pair shortest path algorithm can also be parallelized in O(log n) time using O(n �/ log n) processors. |
本系統中英文摘要資訊取自各篇刊載內容。