Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37439
Title: | 加權外部平面圖之最小迴圈基底 Minimum Cycle Bases of Weighted Outerplanar Graphs |
Authors: | Tsung-Hao Liu 劉宗灝 |
Advisor: | 呂學一(Hsueh-I Lu) |
Keyword: | 迴圈基底,外部平面圖,資料結構, cycle basis,outerplanar,data structure, |
Publication Year : | 2008 |
Degree: | 碩士 |
Abstract: | 本論文提出第一個在加權外部平面圖(weighted outerplanar graph) 上計算最小迴圈基底(minimum cycle basis) 的最佳演算法。更精確地說, 對於任何一個擁有n 個點的加權外部平面圖G, 本論文提出一個O(n) 時間的演算法, 對G 的一組最小迴圈基底C 計算出一個O(n) 空間的精簡表示 (compact representation) Z(C) 。此外, C 中的每一個迴圈, 可在每條邊花費O(1) 時間的情況下由 Z(C) 得知。 We give the first known optimal algorithm that computes a minimum cycle basis for any weighted outerplanar graph. Specifically, for any n-node edge-weighted outerplanar graph G, we give an O(n)-time algorithm to obtain an O(n)-space compact representation Z(C) for a minimum cycle basis C of G. Each cycle in C can be computed from Z(C) in O(1) time per edge. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37439 |
Fulltext Rights: | 有償授權 |
Appears in Collections: | 資訊工程學系 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
ntu-97-1.pdf Restricted Access | 289.8 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.