On the Complexity of Finding a Minimum Cycle Cover of a Graph (Q4337653): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:45, 6 February 2024
scientific article; zbMATH DE number 1012890
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Finding a Minimum Cycle Cover of a Graph |
scientific article; zbMATH DE number 1012890 |
Statements
On the Complexity of Finding a Minimum Cycle Cover of a Graph (English)
0 references
26 May 1997
0 references
complexity
0 references
minimum cycle cover
0 references
