On the Complexity of Finding a Minimum Cycle Cover of a Graph (Q4337653): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539794267255 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054564038 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:53, 30 July 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
