Feedback Vertex Set and Longest Induced Path on AT-Free Graphs

  • Dieter Kratsch
  • Haiko Müller
  • Ioan Todinca
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2880)

Abstract

We give a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.

We also present an O(nm 2) algorithm to compute a longest induced path in AT-free graphs.

Keywords

Polynomial Time Algorithm Interval Graph Free Graph Permutation Graph Private Neighbour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics 12, 289–297 (1999)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bodlaender, H., Thilikos, D.: Treewidth for graphs with small chordality. Discrete Applied Mathematics 79, 45–61 (1997)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Brandstädt, A., Kratsch, D.: On domination problems for permutation and other graphs. Theoretical Computer Science 54, 181–198 (1987)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Brandstädt, A., Lozin, V.V.: On the linear structure and clique width of bipartite permutation graphs, RRR-29-2001, Rutgers UniversityGoogle Scholar
  5. 5.
    Broersma, H.J., Huck, A., Kloks, T., Koppius, O., Kratsch, D., Müller, H., Tuinstra, H.: Degreepreserving trees. Networks 35, 26–39 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Broersma, H.J., Kloks, T., Kratsch, D., Müller, H.: Independent sets in asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics 12, 276–287 (1999)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Broersma, H.J., Kloks, T., Kratsch, D., Müller, H.: A generalization ofAT-free graphs and a generic algorithm for solving triangulation problems. Algorithmica 32, 594–610 (2002)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics 10, 399–430 (1997)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33, 125–150 (2000)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1997)Google Scholar
  11. 11.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-completeness. Freeman, NewYork (1979)MATHGoogle Scholar
  12. 12.
    Gavril, F.: Algorithms for maximum weight induced paths. Information Processing Letters 81, 203–208 (2002)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kloks, K., Kratsch, D., Müller, H.: Asteroidal sets in graphs. In: Möhring, R.H. (ed.) WG 1997. LNCS, vol. 1335, pp. 229–241. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  14. 14.
    Kleinberg, J., Kumar, A.: Wavelength conversion in optical networks. Journal of Algorithms 38, 25–50 (2001)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Köhler, E.: Graphs without asteroidal triples, PhD thesis, TU Berlin (1999), ftp://ftp.math.tu-berlin.de/pub/combi/ekoehler/diss
  16. 16.
    Liang, D.Y.: On the feedback vertex set problem in permutation graphs. Information Processing Letters 52, 123–129 (1994)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Liang, D.Y., Chang, M.S.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Informatica 34, 337–346 (1997)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Lu, C.L., Tang, C.Y.: A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Information Processing Letters 61, 107–111 (1997)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Spinrad, J.: Efficient graph representations, American Mathematical Society, Fields Institute Monograph Series 19 (2003)Google Scholar
  20. 20.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Dieter Kratsch
    • 1
  • Haiko Müller
    • 2
  • Ioan Todinca
    • 3
  1. 1.LITAUniversité de MetzMetz Cedex 01France
  2. 2.School of ComputingUniversity of LeedsLeedsUnited Kingdom
  3. 3.LIFOUniversité d’OrléansOrléans Cedex 2France

Personalised recommendations