Computing Connected Components and Its Applications on an Interval Graph
碩士 === 國立臺灣科技大學 === 工程技術研究所 === 81 === In this thesis, we shall present several algorithms to solve the connected components problem, the transitive closure problem and the all-pair shortest path problem on an interval graph, respectively....
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
1993
|
Online Access: | http://ndltd.ncl.edu.tw/handle/48963573897510758830 |
id |
ndltd-TW-081NTUST027087 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-081NTUST0270872016-02-10T04:08:46Z http://ndltd.ncl.edu.tw/handle/48963573897510758830 Computing Connected Components and Its Applications on an Interval Graph 在區間圖形上研究連通成份的計算及其應用 Horng-Ren Tsai 蔡鴻仁 碩士 國立臺灣科技大學 工程技術研究所 81 In this thesis, we shall present several algorithms to solve the connected components problem, the transitive closure problem and the all-pair shortest path problem on an interval graph, respectively. We first give an O(n*log n) and an O(n**2) optimal time algorithms to compute the connected components and the transitive closure on an interval graph, respectively. Then, an O(n**2) optimal time algorithm for solving the all- pair shortest path problem on an interval graph is proposed. Those algorithms proposed in this paper are suitable to be implemented on parallel computation models. On the EREW PRAM model, we first propose an O(log n) time optimal parallel algorithm for each problem, each with O(n), O(n**2/log n) and O( n**2/log n) processors, respectively. Then, an O(1) step algorithm for each of these problems is also developed on the reconfigurable array of processors, each with O(n**2), O(n**2) and O(n**3) processors , respectively. Shi-Jinn Horng 洪西進 1993 學位論文 ; thesis 86 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣科技大學 === 工程技術研究所 === 81 === In this thesis, we shall present several algorithms to solve
the connected components problem, the transitive closure
problem and the all-pair shortest path problem on an interval
graph, respectively. We first give an O(n*log n) and an O(n**2)
optimal time algorithms to compute the connected components and
the transitive closure on an interval graph, respectively.
Then, an O(n**2) optimal time algorithm for solving the all-
pair shortest path problem on an interval graph is proposed.
Those algorithms proposed in this paper are suitable to be
implemented on parallel computation models. On the EREW PRAM
model, we first propose an O(log n) time optimal parallel
algorithm for each problem, each with O(n), O(n**2/log n) and O(
n**2/log n) processors, respectively. Then, an O(1) step
algorithm for each of these problems is also developed on the
reconfigurable array of processors, each with O(n**2), O(n**2)
and O(n**3) processors , respectively.
|
author2 |
Shi-Jinn Horng |
author_facet |
Shi-Jinn Horng Horng-Ren Tsai 蔡鴻仁 |
author |
Horng-Ren Tsai 蔡鴻仁 |
spellingShingle |
Horng-Ren Tsai 蔡鴻仁 Computing Connected Components and Its Applications on an Interval Graph |
author_sort |
Horng-Ren Tsai |
title |
Computing Connected Components and Its Applications on an Interval Graph |
title_short |
Computing Connected Components and Its Applications on an Interval Graph |
title_full |
Computing Connected Components and Its Applications on an Interval Graph |
title_fullStr |
Computing Connected Components and Its Applications on an Interval Graph |
title_full_unstemmed |
Computing Connected Components and Its Applications on an Interval Graph |
title_sort |
computing connected components and its applications on an interval graph |
publishDate |
1993 |
url |
http://ndltd.ncl.edu.tw/handle/48963573897510758830 |
work_keys_str_mv |
AT horngrentsai computingconnectedcomponentsanditsapplicationsonanintervalgraph AT càihóngrén computingconnectedcomponentsanditsapplicationsonanintervalgraph AT horngrentsai zàiqūjiāntúxíngshàngyánjiūliántōngchéngfèndejìsuànjíqíyīngyòng AT càihóngrén zàiqūjiāntúxíngshàngyánjiūliántōngchéngfèndejìsuànjíqíyīngyòng |
_version_ |
1718184145734074368 |