完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Ho, Chin-Wen | |
| dc.contributor.author | Chang, Jou-Ming | |
| dc.date.accessioned | 2009-08-23T04:39:58Z | |
| dc.date.accessioned | 2020-05-25T06:23:47Z | - |
| dc.date.available | 2009-08-23T04:39:58Z | |
| dc.date.available | 2020-05-25T06:23:47Z | - |
| dc.date.issued | 2006-10-24T09:02:15Z | |
| dc.date.submitted | 1998-12-17 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2411 | - |
| dc.description.abstract | The all-pairs-shortest-length(APSL) problem of a graph is to find the lengths of the shortest paths between all pairs of vertices. In this paper, we study the APSL problem on chordal bipartite graphs. By a simple reduction,we show that solving the APSL problem on chordal bipartite graphs can be transformed to solving the same problem on certain strongly chordal graphs. Consequently, there is an O(n²)time-optimal algorithm for this problem | |
| dc.description.sponsorship | 成功大學,台南市 | |
| dc.format.extent | 539057 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1998 ICS會議 | |
| dc.subject | shortest paths | |
| dc.subject | chordal bipartite graphs | |
| dc.subject | strongly chordal graphs | |
| dc.subject.other | Graph Algorithms | |
| dc.title | Solving the all-pair-shortest-length problem on chordal bipartite graphs | |
| 分類: | 1998年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001998000045.pdf | 526.42 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。