A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

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

題名:	A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
作者:	Hsu, W. L. Nemhauser, G. L.
公開日期:	1982
關聯:	Discrete Mathematics 38, 65-71
URI:	http://ir.sinica.edu.tw/handle/201000000A/39933
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0012-365X&DestApp=JCR&RQ=IF_CAT_BOXPLOT
顯示於：	資訊科學研究所

顯示文件完整紀錄

上周
0

上個月
1

checked on 2025/6/14

檢查