On the complexity of detecting \(k\)-length negative cost cycles (Q1699785)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of detecting \(k\)-length negative cost cycles |
scientific article; zbMATH DE number 6843491
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of detecting \(k\)-length negative cost cycles |
scientific article; zbMATH DE number 6843491 |
Statements
On the complexity of detecting \(k\)-length negative cost cycles (English)
0 references
26 February 2018
0 references
\(k\)-length negative cost cycle
0 references
NP-completeness
0 references
