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....

Full description

Bibliographic Details
Main Authors: Horng-Ren Tsai, 蔡鴻仁
Other Authors: Shi-Jinn Horng
Format: Others
Language:zh-TW
Published: 1993
Online Access:http://ndltd.ncl.edu.tw/handle/48963573897510758830

Similar Items