A 1-matching blossom-type algorithm for edge covering problems (Q3956416): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230120403 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071862730 / rank | |||
Normal rank | |||
Revision as of 21:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 1-matching blossom-type algorithm for edge covering problems |
scientific article |
Statements
A 1-matching blossom-type algorithm for edge covering problems (English)
0 references
1982
0 references
minimum cost edge cover
0 references
undirected network
0 references
worst case computational complexity
0 references
