A 1-matching blossom-type algorithm for edge covering problems (Q3956416): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 13:40, 5 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