Solving the All-pair Shortest Path Query Problem on Interval and Circular-arc Graphs

請用此 Handle URI 來引用此文件： http://ir.sinica.edu.tw/handle/201000000A/39582

題名:	Solving the All-pair Shortest Path Query Problem on Interval and Circular-arc Graphs
作者:	Chen, D. Z. Lee, D. T. Sridhar, R. Sekharan, C. N.
公開日期:	1998-12-01
關聯:	Networks 32, 249-257
URI:	http://ir.sinica.edu.tw/handle/201000000A/39582
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0028-3045&DestApp=JCR&RQ=IF_CAT_BOXPLOT
顯示於：	資訊科學研究所

顯示文件完整紀錄

上周
0

上個月
2

checked on 2025/6/12

檢查