An efficient algorithm for minimumk-covers in weighted graphs (Q4083700): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01580426 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W114839846 / rank | |||
Normal rank | |||
Latest revision as of 08:22, 30 July 2024
scientific article; zbMATH DE number 3501523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for minimumk-covers in weighted graphs |
scientific article; zbMATH DE number 3501523 |
Statements
An efficient algorithm for minimumk-covers in weighted graphs (English)
0 references
1975
0 references
0 references
