Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs

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

Volumn 4921 LNCS, Issue , 2008, Pages 144-156

  Fernau, Henning ^a   Raible, Daniel ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CUBIC GRAPHS; EFFICIENT ALGORITHMS; EXACT ALGORITHMS; PARAMETERIZED; RUNNING TIMES; SUB GRAPHS;

GRAPH THEORY;

EID: 49949118534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77891-2_14     Document Type: Conference Paper

References (17)

1. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal of Discrete Mathematics 12, 289-297 (1999)
2. Berger, B., Shor, P.W.: Approximation algorithms for the maximum acyclic subgraph problem. In: SODA, pp. 236-243 (1990)
3. Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. In: WADS, pp. 422-433 (2007)
4. Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. In: WADS, pp. 495-506 (2007)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
6. Fernau, H.: Parameterized algorithms for HITTING SET: The weighted case. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 332-343. Springer, Heidelberg (2006)
7. Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Handbook of Combinatorial Optimization, vol. Supplement Volume A, pp. 209-258. Kluwer Academic Publishers, Dordrecht (1999)
8. n). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184-191. Springer, Heidelberg (2006)
9. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: Domination - a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191-203. Springer, Heidelberg (2005)
10. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, Plenum Press, New York (1972)
11. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing MAXNP problems above guaranteed values. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 38-49. Springer, Heidelberg (2006)
12. Seminar 07281: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, Dagstuhl, Germany, July 8-13, 2007, Proceedings (to appear, 2007), http://drops.dagstuhl.de/portals/index.php?semnr=07281 http://uk.arxiv.org/pdf/0707.0282.pdf (for a pre-version)
13. Nassi, I., Shneiderman, B.: Flowchart techniques for structured programming. ACM SIGPLAN Notices 12 (1973)
14. Newman, A.: The maximum acyclic subgraph problem and degree-3 graphs. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 147-158. Springer, Heidelberg (2001)
15. Raman, V., Saurabh, S.: Improved fixed parameter tractable algorithms for two edge problems: MAXCUT and MAXDAG. Inf. Process. Lett. 104(2), 65-72 (2007)
16. n). In: ICTCS, vol. 6581, pp. 70-81. World Scientific, Singapore (2007), www.worldscibooks.com/compsci/6581.html
17. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Systems Man Cybernet. 11(2), 109-125 (1981)