On the Complexity of Finding a Minimum Cycle Cover of a Graph

DOI10.1137/S0097539794267255zbMath0870.05040OpenAlexW2054564038MaRDI QIDQ4337653

Carsten Thomassen

Publication date: 26 May 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794267255

zbMATH Keywords

complexityminimum cycle cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38)

Related Items (9)

An overview of graph covering and partitioning ⋮ Lane covering with partner bounds in collaborative truckload transportation procurement ⋮ Shipper collaboration ⋮ A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs ⋮ Parameterized complexity of \(k\)-Chinese postman problem ⋮ Minimum $T$-Joins and Signed-Circuit Covering ⋮ A bound on the total size of a cut cover ⋮ Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width ⋮ A note about shortest cycle covers

This page was built for publication: On the Complexity of Finding a Minimum Cycle Cover of a Graph