А FEEDBACK VERTEX SET |
| 4 | |
| 2013 |
| scientific article | 519.17 | ||
| 190-193 | graphs, disjoint cycles, cycle packing, cycle covering. |
| It has been shown that the following problem can be solved in the time linear in the number of vertices: given a simple graph, find in it two vertex-disjoint cycles or build a feedback vertex set that contains no more than 3 vertices. |
 |