論文使用權限 Thesis access permission:校內外都一年後公開 withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available
論文名稱 Title |
區間圖、 排列圖 及梯形圖上的t-擴展樹
Finding Tree t-spanners on Interval, Permutation and Trapezoid Graphs |
||
系所名稱 Department |
|||
畢業學年期 Year, semester |
語文別 Language |
||
學位類別 Degree |
頁數 Number of pages |
51 |
|
研究生 Author |
|||
指導教授 Advisor |
|||
召集委員 Convenor |
|||
口試委員 Advisory Committee |
|||
口試日期 Date of Exam |
2002-07-12 |
繳交日期 Date of Submission |
2002-08-26 |
關鍵字 Keywords |
排列圖、及梯形圖上的t-擴展樹、區間圖 permutation graphs, interval graphs, trapezoid graphs, t-spanner |
||
統計 Statistics |
本論文已被瀏覽 5702 次,被下載 1937 次 The thesis/dissertation has been browsed 5702 times, has been downloaded 1937 times. |
中文摘要 |
在這篇論文中,我們先介紹了一個演算法來找出梯形圖上的4-拓展樹,接著介紹了一個在排列圖上改良過後的3-拓展樹, 然後我們依據這個演算法作雛形, 在梯形圖來找出邊數最多為2n 的拓展者, 最後我們提出一個反證證明 區間圖上沒有2-拓展樹. 至於複雜度方面,找出梯形圖的4-拓展樹為 O(n), 在排列圖上改良過後的3-拓展樹為O(n)(原來是O(m + n)) ,在梯形圖找出邊數最多為2n 的拓展者為O(n) |
Abstract |
A t-spanner of a graph G is a subgraph H of G, which the distance between any two vertices in H is at most t times their distance in G. A tree t-spanner of G is a t-spanner which is a tree. In this dissertation, we discuss the t-spanners on trapezoid, permutation, and interval graphs. We first introduce an O(n) algorithm for finding a tree 4-spanner on trapezoid graphs. Then, give an O(n)algorithm for finding a tree 3-spanner on permutation graphs, improving the existed O(n + m) algorithm. Since the class of permutation graphs is a subclass of trapezoid graphs, we can apply the algorithm on permutation graphs to find the approximation of a tree 3-spanner on trapezoid graphs in O(n) time with edge bound 2n. Finally, we show that not all interval graphs have a tree 2-spanner. |
目次 Table of Contents |
ABSTRACT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0 Chapter 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Chapter 2. Permutation, Interval, and Trapezoid Graphs . . . . . . . 4 Chapter 3. Tree 4-Spanners on Trapezoid Graphs . . . . . . . . . . . 9 3.1 Prelimiaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.2 Ekkehard’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.3 Finding a Tree 4-spanner of a Trapezoid Graph . . . . . . . . . . . . 12 3.4 The Correctness of Algorithm3.B . . . . . . . . . . . . . . . . . . . . 15 3.5 Implementing Algorithm 3.B in O(n) Time . . . . . . . . . . . . . . . 25 Chapter 4. Tree 3-Spanners on Permutation Graphs . . . . . . . . . . 32 4.1 Madanlal’s Algorithm. . . . . . . . . . . . . . . . . . . . . . . . . . . 32 4.2 An O(n) Algorithm for Finding a Tree 3-spanner . . . . . . . . . . . 34 4.3 The Correctness of Algorithm4.B . . . . . . . . . . . . . . . . . . . . 36 Chapter 5. Finding a 3-spanner of Edge Bound 2n on Trapezoid graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 5.1 Finding a 3-spanner . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 5.2 The Correctness of Algorithm5.A . . . . . . . . . . . . . . . . . . . . 43 Page Chapter 6. Tree t-spanners on Interval Graphs . . . . . . . . . . . . . 45 6.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 6.2 An Example of One Interval Graph Without Having Tree 2-spanner . . . 46 Chapter 7. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 BIBLIOGRAPHY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 |
參考文獻 References |
[1] S. Arikati, D. Chen, L. P. Chew, G. Das, M. Smid, and D. Zaroliagis, “Plannar spanners and approximate shortest path queries among obstacles in the plane,” in:J.Diaz(ED.), Algorithm-ESA ’96, Springer Lecture Notes in Computer Science, Vol. 1136, pp. 399–407, 1996. [2] K. Arvind and C. P. Rangan, “Connected domination and steiner set on weighted permutation graphs,” Infornation Processing Letters, Vol. 41, pp. 215– 220, 1992. [3] V. Bojarshinov, “Edge and total coloring of interval graphs,” Discrete Applied Mathematics, Vol. 14, pp. 23–28, 2001. [4] A. Brands¨adt and F. Krash, “On domination problems for permutatiob and other graphs,” Theoretical Computer Science, Vol. 54, pp. 181–198, 1987. [5] L. Cai and D. G. Corneil, “Tree spanners,” SIAM Journal on Discrete Mathmatics, Vol. 8, pp. 359–387, 1995. [6] Chang, Maw-Shang, Nagavamsi, P., Rangan, and C. Pandu, “Weighted irredundance of interval graphs,” Information Processing Letters, pp. 65–70, 1998. [7] L. P. Chew, “There is a plannar graph almost as good as the complete graph,” Proceeding of the Second ACM symposium on Computational Geometry, pp. 399–407, 1996. [8] C. J. Colbourn and L. K. Stewart, “Permutation graphs: Connected domination and steiner trees,” Discrete Applied Mathmatics, pp. 179–189, 1990. [9] D. Corneil and P. Kamula, “Extension of permutation and interval,” Proceeding of the 18th Southeast. Coference on Combinatorics, Graph Theoy, and Compuing, BocaRatonm FL; Congressus Numerantium, Vol. 58, pp. 267–275, 1987. [10] I. Dagan, M. C. GOLUMBIC, and R. Y. Pinter, “Trapezoid graphs and their coloring,” Discrete Applied Mathmatics, Vol. 21, pp. 97–102, 1988. 49 [11] D. P. Dobkin, S. J. Friedman, and K. J. Supowit, “Delaunay graphs are as almost good as complete graphs,” Discrete & Computational Geometry, Vol. 15, pp. 399–407, 1990. [12] W. Duckworth and M. Zito, “Sparse hypercube 3-spanners,” Discrete Applied Mathmatics, Vol. 59, pp. 289–295, 2000. [13] M. Farber and j. M. Keil, “Domination in permutation graphs,” Journal of Algorithms, Vol. 16, pp. 453–469, 1994. [14] M. C. Golumbic, Algorithm Graph Theory and Perfect Graphs. New York: Academic Press, 1980. [15] J. Y. Hsiao and C. Y. Tang, “An efficent algorithm for finding a maximum weight 2-independent set on inerval graphs,” Information Processing Letters, Vol. 43, pp. 229–235, 1992. [16] k¨ohler, “Connected dominating clique in trapezoid graph,” Discrete Applied Mathmatics, Vol. 99, pp. 91–110, 2000. [17] Y. D. Ling, “Domination in trapezoid grpahs,” Infornation Processing Letters, Vol. 52, pp. 309–315, 1994. [18] Y. D. Ling, “Steiner set and connected domination,” Infornation Processing Letters, Vol. 56, pp. 101–108, 1996. [19] Y. D. Ling, C. Rhee, S. K. Dall, and S. Lakashmivarahan, “A new approach for teh domination problem on permutation graphs,” Infornation Processing Letters, Vol. 37, pp. 219–224, 1991. [20] M. S. Madanlal, G. Venkatesan, and C. P. Rangan, “Tree 3-spanners on interval, permutation and regular bipartite graphs,” Infornation Processing Letters, pp. 97–102, 1996. [21] D. Peleg and A. A. Sch¨affer, “Graph spanners,” Congressus Numberantium, Vol. 13, pp. 329–343, 1982. [22] D. Peleg and J. Ullman, “An optimal synchronizer for the hypercube,” Proceeding of the 6th ACM Symoisium on Principles of Distributed Computing, pp. 77–85, 1987. [23] G. Ramalingam and C. P. Rangan, “A unified approach to domination problems on interval graphs,” Infornation Processing Letters, Vol. 27, pp. 271–274, 1988. 50 [24] C. Rhee, Y. D. Ling, S. K. Dhall, and S. Lakashmivarahan, “An o(n+m) algorithm for finding minimum weight dominating set in permutation graphs,” SIAM Journal on Computing, Vol. 25(2), pp. 404–419, 1996. [25] J. Soares, “Graph spanners: a survey,” Congressus Numerantium, Vol. 89, pp. 225–238, 1992. [26] K. H. Tsai and W. L. Hsu, “Fast algorithm for the dominating set problem on permutation graphs,” Algorithmuca, Vol. 9, pp. 601–614, 1993. |
電子全文 Fulltext |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。 論文使用權限 Thesis access permission:校內外都一年後公開 withheld 開放時間 Available: 校內 Campus: 已公開 available 校外 Off-campus: 已公開 available |
紙本論文 Printed copies |
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。 開放時間 available 已公開 available |
QR Code |