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

DOI10.1016/0012-365X(82)90169-8zbMath0475.68040MaRDI QIDQ1159467

S. H. Smith

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

packing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)