Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Feedback vertex set
A set of vertices in a node-link graph whose deletion eliminates all cycles in the graph

In the mathematical discipline of graph theory, a feedback vertex set (FVS) of a graph is a set of vertices whose removal leaves a graph without cycles ("removal" means deleting the vertex and all edges adjacent to it). Equivalently, each FVS contains at least one vertex of any cycle in the graph. The feedback vertex set number of a graph is the size of a smallest FVS. Whether there exists a feedback vertex set of size at most k is an NP-complete problem; it was among the first problems shown to be NP-complete. It has wide applications in operating systems, database systems, and VLSI chip design.

We don't have any images related to Feedback vertex set yet.
We don't have any YouTube videos related to Feedback vertex set yet.
We don't have any PDF documents related to Feedback vertex set yet.
We don't have any Books related to Feedback vertex set yet.
We don't have any archived web articles related to Feedback vertex set yet.

Definition

The FVS decision problem is as follows:

INSTANCE: An (undirected or directed) graph G = ( V , E ) {\displaystyle G=(V,E)} and a positive integer k {\displaystyle k} . QUESTION: Is there a subset X ⊆ V {\displaystyle X\subseteq V} with | X | ≤ k {\displaystyle |X|\leq k} such that, when all vertices of X {\displaystyle X} and their adjacent edges are deleted from G {\displaystyle G} , the remainder is cycle-free?

The graph G [ V ∖ X ] {\displaystyle G[V\setminus X]} that remains after removing X {\displaystyle X} from G {\displaystyle G} is an induced forest (resp. an induced directed acyclic graph in the case of directed graphs). Thus, finding a minimum FVS in a graph is equivalent to finding a maximum induced forest (resp. maximum induced directed acyclic graph in the case of directed graphs).

NP-completeness

Karp (1972) showed that finding a feedback vertex set of size ≤ k {\displaystyle \leq k} in directed graphs is NP-complete. The problem remains NP-complete on directed graphs with maximum in-degree and out-degree two, and on directed planar graphs with maximum in-degree and out-degree three.1

Karp's reduction also implies the NP-completeness of the feedback vertex set problem on undirected graphs, where the problem stays NP-complete on graphs of maximum degree four. The feedback vertex set problem can be solved in polynomial time on graphs of maximum degree at most three, using an algorithm based on the matroid parity problem.2

Exact algorithms

The corresponding NP optimization problem of finding the size of a minimum feedback vertex set can be solved in time O(1.7347n), where n is the number of vertices in the graph.3 This algorithm actually computes a maximum induced forest, and when such a forest is obtained, its complement is a minimum feedback vertex set. The number of minimal feedback vertex sets in a graph is bounded by O(1.8638n).4 The directed feedback vertex set problem can still be solved in time O*(1.9977n), where n is the number of vertices in the given directed graph.5 The parameterized versions of the directed and undirected problems are both fixed-parameter tractable.6

In undirected graphs of maximum degree three, the feedback vertex set problem can be solved in polynomial time, by transforming it into an instance of the matroid parity problem for linear matroids.7

Approximation

The undirected problem is APX-complete. This follows from the following facts.

  • The APX-completeness of the vertex cover problem;8
  • The existence of an approximation preserving L-reduction from the vertex cover problem to it;
  • Existing constant-factor approximation algorithms.9

The best known approximation algorithm on undirected graphs is by a factor of two.10

By contrast, the directed version of the problem appears to be much harder to approximate. Under the unique games conjecture, an unproven but commonly used computational hardness assumption, it is NP-hard to approximate the problem to within any constant factor in polynomial time. The same hardness result was originally proven for the closely related feedback arc set problem,11 but since the feedback arc set problem and feedback vertex set problem in directed graphs are reducible to one another while preserving solution sizes,12 it also holds for the latter.

Bounds

According to the Erdős–Pósa theorem, the size of a minimum feedback vertex set is within a logarithmic factor of the maximum number of vertex-disjoint cycles in the given graph.13

  • Instead of vertices, one can consider a feedback edge set - a set of edges in an undirected graph, whose removal makes the graph acyclic. The size of a smallest feedback edge set in a graph is called the circuit rank of the graph. In contrast to the FVS number, the circuit rank can be easily computed: it is | E | − | V | + | C | {\displaystyle |E|-|V|+|C|} , where C is the set of connected components of the graph. The problem of finding a smallest feedback edge set is equivalent to finding a spanning forest, which can be done in polynomial time.
  • The analogous concept in a directed graph is the feedback arc set (FAS) - a set of directed arcs whose removal makes the graph acyclic. Finding a smallest FAS is an NP-hard problem.14

Applications

  • In operating systems, feedback vertex sets play a prominent role in the study of deadlock recovery. In the wait-for graph of an operating system, each directed cycle corresponds to a deadlock situation. In order to resolve all deadlocks, some blocked processes have to be aborted. A minimum feedback vertex set in this graph corresponds to a minimum number of processes that one needs to abort.15
  • The feedback vertex set problem has applications in VLSI chip design.16
  • Another application is in complexity theory. Some computational problems on graphs are NP-hard in general, but can be solved in polynomial time for graphs with bounded FVS number. Some examples are graph isomorphism17 and the path reconfiguration problem.18

Notes

Research articles

Textbooks and survey articles

References

  1. unpublished results due to Garey and Johnson, cf. Garey & Johnson (1979): GT7 - Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, A1.1: GT7, p. 191, ISBN 978-0-7167-1045-5 https://archive.org/details/computersintract0000gare/page/ ↩

  2. Ueno, Kajitani & Gotoh (1988); Li & Liu (1999) - Ueno, Shuichi; Kajitani, Yoji; Gotoh, Shin'ya (1988), "On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three", Discrete Mathematics, 72 (1–3): 355–360, doi:10.1016/0012-365X(88)90226-9, MR 0975556 https://doi.org/10.1016%2F0012-365X%2888%2990226-9 ↩

  3. Fomin & Villanger (2010) - Fomin, Fedor V.; Villanger, Yngve (2010), "Finding induced subgraphs via minimal triangulations", Proc. 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Leibniz International Proceedings in Informatics (LIPIcs), vol. 5, pp. 383–394, doi:10.4230/LIPIcs.STACS.2010.2470, ISBN 9783939897163, S2CID 436224 https://doi.org/10.4230%2FLIPIcs.STACS.2010.2470 ↩

  4. Fomin et al. (2008). - Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem; Razgon, Igor (2008), "On the minimum feedback vertex set problem: exact and enumeration algorithms.", Algorithmica, 52 (2): 293–307, CiteSeerX 10.1.1.722.8913, doi:10.1007/s00453-007-9152-0, S2CID 731997 https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.8913 ↩

  5. Razgon (2007). - Razgon, I. (2007), "Computing minimum directed feedback vertex set in O*(1.9977n)", in Italiano, Giuseppe F.; Moggi, Eugenio; Laura, Luigi (eds.), Proceedings of the 10th Italian Conference on Theoretical Computer Science (PDF), World Scientific, pp. 70–81 http://www.cs.le.ac.uk/people/ir45/papers/ictcsIgorCamera.pdf ↩

  6. Chen et al. (2008). - Chen, Jianer; Liu, Yang; Lu, Songjian; O'Sullivan, Barry; Razgon, Igor (2008), "A fixed-parameter algorithm for the directed feedback vertex set problem", Journal of the ACM, 55 (5), Art. 21, doi:10.1145/1411509.1411511, MR 2456546, S2CID 1547510 https://doi.org/10.1145%2F1411509.1411511 ↩

  7. Ueno, Kajitani & Gotoh (1988). - Ueno, Shuichi; Kajitani, Yoji; Gotoh, Shin'ya (1988), "On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three", Discrete Mathematics, 72 (1–3): 355–360, doi:10.1016/0012-365X(88)90226-9, MR 0975556 https://doi.org/10.1016%2F0012-365X%2888%2990226-9 ↩

  8. Dinur & Safra 2005 - Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex cover" (PDF), Annals of Mathematics, Second Series, 162 (1): 439–485, doi:10.4007/annals.2005.162.439, MR 2178966, archived from the original (PDF) on 2009-09-20, retrieved 2010-03-29 https://web.archive.org/web/20090920071048/http://www.cs.huji.ac.il/~dinuri/mypapers/vc.pdf ↩

  9. Karp (1972) - Karp, Richard M. (1972), "Reducibility Among Combinatorial Problems", Proc. Symposium on Complexity of Computer Computations, IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., New York: Plenum, pp. 85–103 ↩

  10. Becker & Geiger (1996). See also Bafna, Berman & Fujito (1999) for an alternative approximation algorithm with the same approximation ratio. - Becker, Ann; Geiger, Dan (1996), "Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem.", Artificial Intelligence, 83 (1): 167–188, CiteSeerX 10.1.1.25.1442, doi:10.1016/0004-3702(95)00004-6 https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.1442 ↩

  11. Guruswami, Venkatesan; Manokaran, Rajsekar; Raghavendra, Prasad (2008). "Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 573–582. doi:10.1109/FOCS.2008.51. ISBN 978-0-7695-3436-7. S2CID 8762205. 978-0-7695-3436-7 ↩

  12. Even, G.; (Seffi) Naor, J.; Schieber, B.; Sudan, M. (1998). "Approximating Minimum Feedback Sets and Multicuts in Directed Graphs". Algorithmica. 20 (2): 151–174. doi:10.1007/PL00009191. ISSN 0178-4617. S2CID 2437790. http://link.springer.com/10.1007/PL00009191 ↩

  13. Erdős & Pósa (1965). - Erdős, Paul; Pósa, Lajos (1965), "On independent circuits contained in a graph" (PDF), Canadian Journal of Mathematics, 17: 347–352, doi:10.4153/CJM-1965-035-8, S2CID 123981328 http://www.renyi.hu/~p_erdos/1965-05.pdf ↩

  14. Karp (1972) - Karp, Richard M. (1972), "Reducibility Among Combinatorial Problems", Proc. Symposium on Complexity of Computer Computations, IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., New York: Plenum, pp. 85–103 ↩

  15. Silberschatz, Galvin & Gagne (2008). - Silberschatz, Abraham; Galvin, Peter Baer; Gagne, Greg (2008), Operating System Concepts (8th ed.), John Wiley & Sons. Inc, ISBN 978-0-470-12872-5 ↩

  16. Festa, Pardalos & Resende (2000). - Festa, P.; Pardalos, P. M.; Resende, M.G.C. (2000), "Feedback set problems", in Du, D.-Z.; Pardalos, P. M. (eds.), Handbook of Combinatorial Optimization, Supplement vol. A (PDF), Kluwer Academic Publishers, pp. 209–259 http://www.research.att.com/~mgcr/doc/sfsp.pdf ↩

  17. Kratsch, Stefan; Schweitzer, Pascal (2010). "Isomorphism for Graphs of Bounded Feedback Vertex Set Number". In Kaplan, Haim (ed.). Algorithm Theory - SWAT 2010. Lecture Notes in Computer Science. Vol. 6139. Berlin, Heidelberg: Springer. pp. 81–92. Bibcode:2010LNCS.6139...81K. doi:10.1007/978-3-642-13731-0_9. ISBN 978-3-642-13731-0. 978-3-642-13731-0 ↩

  18. Algorithms and Data Structures (PDF). Lecture Notes in Computer Science. Vol. 11646. 2019. doi:10.1007/978-3-030-24766-9. ISBN 978-3-030-24765-2. S2CID 198996919. 978-3-030-24765-2 ↩