Skip to main content
SpringerLink
Log in

Feedback Vertex Set in Mixed Graphs

  • Conference paper
Algorithms and Data Structures (WADS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6844))

Included in the following conference series:

Abstract

A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on n vertices contains a feedback vertex set (FVS) of size at most k, in time O(47.5k ·k! ·n 4). This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12, 289–297 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Becker, A., Geiger, D.: Optimization of Pearl’s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83, 167–188 (1996)

    Article  MathSciNet  Google Scholar 

  3. Bodlaender, H.L.: On disjoint cycles. Int. J. Found. Comput. Sci. 5, 59–68 (1994)

    Article  MATH  Google Scholar 

  4. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M. (Meta) kernelization. In: FOCS 2009, pp. 629–638. IEEE, Los Alamitos (2009)

    Google Scholar 

  5. Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 93–104. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Chen, J., Fomin, F., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74, 1188–1198 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, J., Liu, Y., Lu, S., O’sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55, 1–19 (2008)

    MathSciNet  MATH  Google Scholar 

  8. Dehne, F., Fellows, M.R., Langston, M., Rosamond, F., Stevens, K.: An O(2O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. Theor. Comput. Syst. 41, 479–492 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24, 873–921 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)

    Book  MATH  Google Scholar 

  11. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151–174 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Festa, P., Pardalos, P.M., Resende, M.: Feedback set problems. Handbook of Combinatorial Optimization A(Supplement), 209–258 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)

    MATH  Google Scholar 

  14. Fomin, F., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: STACS 2010. LIPIcs, vol. 5, pp. 383–394. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik (2010)

    Google Scholar 

  15. Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52, 293–307 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72, 1386–1396 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Jain, K., Hajiaghayi, M., Talwar, K.: The generalized deadlock resolution problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 853–865. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Kanj, I., Pelsmajer, M., Schaefer, M.: Parameterized algorithms for feedback vertex set. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 235–247. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations, 85–103 (1972)

    Google Scholar 

  20. Mehlhorn, K.: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. Springer, Heidelberg (1984)

    Book  MATH  Google Scholar 

  21. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, Oxford (2006)

    Book  MATH  Google Scholar 

  22. Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for undirected feedback vertex set. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 241–248. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2, 403–415 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  24. Razgon, I.: Computing minimum directed feedback vertex set in O(1.9977\(^{\mbox{n}}\)). In: ICTCS, pp. 70–81 (2007)

    Google Scholar 

  25. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32, 299–301 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  26. Thomassé, S.: A 4k 2 kernel for feedback vertex set. ACM Trans. Algorithms 6 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Paul Bonsma

  2. Department of Computer Science and Engineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA, 92093-0404, USA

    Daniel Lokshtanov

Authors
  1. Paul Bonsma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Lokshtanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, VISM Building, Room 6210, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Frank Dehne

  2. Department of Computer Science and Engineering, Polytechnic Institute of New York University, 5 MetroTech Center, 11201, New York, NY, USA

    John Iacono

  3. School of Computer Science, Herzberg Laboratories, Carleton University, Herzberg Building, Room 5350, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonsma, P., Lokshtanov, D. (2011). Feedback Vertex Set in Mixed Graphs. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22300-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22299-3

  • Online ISBN: 978-3-642-22300-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation