On feedback vertex set new measure and new structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6139 LNCS, Issue , 2010, Pages 93-104

  Cao, Yixin ^a   Chen, Jianer ^a   Liu, Yang ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEEDBACK VERTEX SET; MAXIMUM GENUS; NEW STRUCTURES; PARAMETERIZED ALGORITHM; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; SEARCH PROCESS; SPECIAL STRUCTURE; STRUCTURAL STUDIES; UNDIRECTED GRAPH;

ALGORITHMS; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 77954644038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13731-0_10     Document Type: Conference Paper

References (23)

1. Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res. 12, 219-234 (2000)
2. Bodlaender, H.: On disjoint cycles. Int. J. Found. Comput. Sci. 5(1), 59-68 (1994)
3. Cao, Y., Chen, J., Liu, Y.: On Feedback Vertex Set New Measure and New Structures (manuscript, 2010)
4. Chen, J.: Minimum and maximum imbeddings. In: Gross, J., Yellen, J. (eds.) The Handbook of Graph Theory, pp. 625-641. CRC Press, Boca Raton (2003)
5. Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. Journal of Computer and System Sciences 74, 1188-1198 (2008)
6. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)
7. 3) fpt algorithm for the undirected feedback vertex set problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 859-869. Springer, Heidelberg (2005)
8. Downey, R., Fellows, M.: Fixed parameter tractability and completeness. In: Complexity Theory: Current Research, pp. 191-225. Cambridge University Press, Cambridge (1992)
9. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
10. Festa, P., Pardalos, P., Resende, M.: Feedback set problems. In: Handbook of Combinatorial Optimization, vol. A(suppl.), pp. 209-258. Kluwer Acad. Publ., Dordrecht (1999)
11. Fomin, F., Gaspers, S., Pyatkin, A.: Finding a minimum feedback vertex set in time O(1.7548n). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184-191. Springer, Heidelberg (2006) (Pubitemid 44609923)
12. Furst, M., Gross, J., McGeoch, L.: Finding a maximum-genus graph imbedding. Journal of the ACM 35(3), 523-534 (1988) (Pubitemid 18648605)
13. Gabow, H., Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 210-220. Springer, Heidelberg (1985)
14. 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(8), 1386-1396 (2006)
15. 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)
16. Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85-103. Plenum Press, New York (1972)
17. Li, D., Liu, Y.: A polynomial algorithm for finding the minimul feedback vertex set of a 3-regular simple graph. Acta Mathematica Scientia 19(4), 375-381 (1999)
18. Lovász, L.: The matroid matching problem. In: Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis János Bolyai, Szeged, Hungary (1978)
19. Raman, V., Saurabh, S., Subramanian, C.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2(3), 403-415 (2006) (Pubitemid 44452179)
20. Raman, V., Saurabh, S., Subramanian, C.: 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)
21. Razgon, I.: Exact computation of maximum induced forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 160-171. Springer, Heidelberg (2006)
22. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299-301 (2004)
23. Silberschatz, A., Galvin, P.: Operating System Concepts, 4th edn. Addison-Wesley, Reading (1994)