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

Full description

Bibliographic Details
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