On the complexity of detecting \(k\)-length negative cost cycles

DOI10.1007/978-3-319-71150-8_21zbMath1470.68058OpenAlexW2768325615MaRDI QIDQ1699785

Longkun Guo, Peng Li

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_21

zbMATH Keywords

NP-completeness\(k\)-length negative cost cycle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Engineering Negative Cycle Canceling for Wind Farm Cabling

This page was built for publication: On the complexity of detecting \(k\)-length negative cost cycles