Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)
MINIMUM VERTEX DISJOINT
CYCLE COVER
Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)
Next: MINIMUM CUT COVER
Up: Covering and Partitioning
Previous: MINIMUM COMPLETE BIPARTITE SUBGRAPH
Index
- INSTANCE:
Graph
.
- SOLUTION:
A family F of vertex disjoint cycles covering V.
- MEASURE:
Number of cycles in F.
- Bad News:
Not in APX [426].
- Comment:
Variation in which the graph G is directed is not in APX.
Same results are known for covering with edge disjoint cycles. [426].
Viggo Kann
2000-03-20