Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

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

題名:	Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems
作者:	Andrews, M. G. Atallah, M. J. Chen, D. Z. Lee, D. T.
公開日期:	2000-02-01
關聯:	Algorithmica 26, 263-289
URI:	http://ir.sinica.edu.tw/handle/201000000A/39585
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0178-4617&DestApp=JCR&RQ=IF_CAT_BOXPLOT
顯示於：	資訊科學研究所

顯示文件完整紀錄

上周
0

上個月
3

checked on 2025/6/8

檢查