Algorithm for minimum covering by cliques and maximum cliques in claw-free perfect graphs

Please use this identifier to cite or link to this item: http://ir.sinica.edu.tw/handle/201000000A/39934

Title:	Algorithm for minimum covering by cliques and maximum cliques in claw-free perfect graphs
Authors:	Hsu, W. L. Nemhauser, G. L.
Issue Date:	1981
Relation:	Discrete Mathematics 37, 181-191
URI:	http://ir.sinica.edu.tw/handle/201000000A/39934
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0012-365X&DestApp=JCR&RQ=IF_CAT_BOXPLOT
Appears in Collections:	資訊科學研究所

Show full item record

Last Week
0

Last month
1

checked on Jun 13, 2025

Check