An Algorithm for the Optimal Ranking Problem on Interval Graphs
碩士 === 國立中興大學 === 應用數學系 === 84 === In this thesis, we develop a sequential algorithm for the optimal rankingproblem on interval graphs. Given a set of n intervals, our optimal ranking algorithm takes O(an^3) time to find an optimal ran...
Main Authors: | Wang, Chen-Wen, 王中文 |
---|---|
Other Authors: | Ming-Shing Yu |
Format: | Others |
Language: | zh-TW |
Published: |
1996
|
Online Access: | http://ndltd.ncl.edu.tw/handle/11737149592745167969 |
Similar Items
-
OPTIMAL ALGORITHMS FOR INTERVAL GRAPHS
by: Jiang, Guo-Jing, et al.
Published: (1995) -
An Efficient Algorithm for the Interval Graph Completion Problem on Primitive Starlike Graphs
by: Chi-Kang Chen, et al.
Published: (2002) -
Efficient algorithms for some path problems on interval graphs
by: LIAO, ZHENG-LIANG, et al.
Published: (1992) -
Efficient algorithms for comatic partition problem on interval graphs and their extensons
by: PENG, SHENG-LONG, et al.
Published: (1992) -
The Problems of Rankings on Sierpinski graphs
by: YO-Lin Lin, et al.
Published: (2010)