政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/14987

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113318/144297 (79%)
Visitors : 51041796 Online Users : 914

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 > Item 140.119/14987

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/14987

Title:	Some Optimal Parallel Algorithms on Interval and Circular-Arc Graphs
Authors:	許芳榮;沈錳坤;趙考蜀;李家同
Keywords:	parallel algorithms,EREW PRAM,all-pair shortest path,hinge vertex,interval graph
Date:	2005-05
Issue Date:	2008-12-16 16:41:12 (UTC+8)
Abstract:	In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and suffix computations and the Euler tour technique. Our preprocessing algorithms run in O(log n) time using O(nlog n) processors. Using the data structure constructed by our preprocessing algorithms, a query of the length of a shortest path between any two vertices can be answered in constant time by using a single processor. For the hinge vertex problem on interval graphs, we propose an O(log n) time algorithm using O(nlog n) processors. It leads to a linear time sequential algorithm. Our algorithms work on the EREW PRAM model.
Relation:	Journal of Information Science and Engineering, 21(3), 627-642
Data Type:	article
Appears in Collections:	[資訊科學系] 期刊論文

Files in This Item:

File	Size	Format
51.pdf	586Kb	Adobe PDF2	1510	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...