"A polynomial algorithm for the minimum weighted clique cover problem on ..."

Wen-Lian Hsu, George L. Nemhauser (1982)

> Home

Details and statistics

DOI: 10.1016/0012-365X(82)90169-8

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/HsuN82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/HsuN82
Wen-Lian Hsu, George L. Nemhauser:
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. Discret. Math. 38(1): 65-71 (1982)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.