Skip to main content
SpringerLink
Log in

A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs

  • Original Papers
  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

A feedback vertex set is a subset of vertices in a graph, whose deletion from the graph makes the resulting graph acyclic. In this paper, we study the minimum-weight feedback vertex set problem in series-parallel graphs and present a linear-time exact algorithm to solve it.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arnborg, S., Lagergren, J., Seese, D. Easy problem for tree-decomposable graphs, Journal of Algorithms, 12(2): 308–340 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bafna, V., Berman, P., Fujito, T. Constant ratio approximation of the weighted feedback vertex set problem for undirected graphs. ISAAC’95 Algorthms and Computations, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1004: 142–151 (1995)

  3. Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference, SIAM Journal on Computing, 27(4): 942–959 (1998)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Bondy, J.A., Murty, U.S.R. Graph theory with applications. The Macmillan Press, London, 1976

  6. Chudak, F., Goemans, M., Hochbaum, D., Williamson, D. A Primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs, Operations Research Letters, 22: 111–118 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Didi Biha, M., Mahjoub, A.R. Steiner k-Edge connected subgraph polyhedra, Journal of Combinatorial Optimization, 4: 131–144 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Garey, M.R., Johnson, D. S. Computers and intractability. W. H. Freeman and Company, New York, 1979

  9. Gibbons, A. Algorithmic graph theory. Cambridge University Press, Cambridge 1985

  10. Kleinberg, J., Kumar, A. Wavelength conversion in optical networks, Proc. of the 10th ACM-SIAM Symp. on Discrete Algorithms, 566–575 (1999)

  11. Li, D., Liu, Y. A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simple graph, Acta Mathematica Scientia, 19(4): 375–381 (1999)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer and Information Engineering, Tianjin Normal University, Tianjin, 300074, China

    Shao-qiang Zhang

  2. Institute of Software, CAS, Beijing, 100080, China

    Guo-jun Li

  3. School of Mathematics and System Sciences, Shandong University, Jinan, 250100, China

    Guo-jun Li

  4. Department of Mathematics and Information Science, Yantai University, Yantai, 264005, China

    Shu-guang Li

Authors
  1. Shao-qiang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guo-jun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shu-guang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shao-qiang Zhang.

Additional information

Supported by the National Science Foundation of China (No.10271065, 60373025).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Sq., Li, Gj. & Li, Sg. A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs. Acta Mathematicae Applicatae Sinica, English Series 20, 579–588 (2004). https://doi.org/10.1007/s10255-004-0195-6

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-004-0195-6

Keywords

2000 MR Subject Classification

Search

Navigation