Speeding up dynamic programming for some np-hard graph recoloring problems

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

Volumn 4978 LNCS, Issue , 2008, Pages 490-501

  Ponta, Oriana ^a   Hüffner, Falk ^b   Niedermeier, Rolf ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; CONVOLUTION; NP-HARD; TREES (MATHEMATICS);

COMPLETION PROBLEM; CONNECTED COMPONENT; CONVEX COLORINGS; MINIMUM WEIGHT; RUNNING TIME; VERTEX COLORING; VERTEX DEGREE; WEIGHTED MODELS;

DYNAMIC PROGRAMMING;

EID: 70349318151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_43     Document Type: Conference Paper

References (20)

1. Bachoore, E.H., Bodlaender, H.L.: Convex recoloring of leaf-colored trees. In: Proc. 3rd ACiD. Texts in Algorithmics, vol. 9, pp. 19-33. College Publications, London (2007)
2. Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. Theory of Computing Systems, (to appear, 2007)
3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proc. 39th STOC, pp. 67-74. ACM Press, New York (2007)
4. Blum, C.: Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research 177(1), 102-115 (2007)
5. Bodlaender, H.L., Weyer, M.: Convex and connected recolorings of trees and graphs (unpublished manuscript, 2005)
6. Bodlaender, H.L., Fellows, M.R., Langston, M.A., Ragan, M.A., Rosamond, F.A., Weyer, M.: Kernelization for convex recoloring. In: Proc. 2nd ACiD. Texts in Algorithmics, vol. 7, pp. 23-35. College Publications, London (2006)
7. Bodlaender, H.L., Fellows, M.R., Langston, M.A., Ragan, M.A., Rosamond, F.A., Weyer, M.: Quadratic kernelization for convex recoloring of trees. In: Lin, G. (ed.) COCOON. LNCS, vol. 4598, pp. 86-96. Springer, Heidelberg (2007)
8. Chor, B., Fellows, M.R., Ragan, M.A., Razgon, I., Rosamond, F.A., Snir, S.: Connected coloring completion for general graphs: Algorithms and complexity. In: Lin, G. (ed.) COCOON. LNCS, vol. 4598, pp. 75-85. Springer, Heidelberg (2007)
9. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
10. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195-207 (1972)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
12. Fürer, M.: Faster integer multiplication. In: Proc. 39th STOC, pp. 57-66. ACM Press, New York (2007)
13. Lingas, A., Wahlen, M.: On exact complexity of subgraph homeomorphism. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 256-261. Springer, Heidelberg (2007)
14. Maffioli, F.: Finding a best subtree of a tree. Technical Report 91.041, Politecnico di Milano, Dipartimento di Elettronica, Italy (1991)
15. Moran, S., Snir, S.: Convex recolorings of strings and trees: Definitions, hardness results and algorithms. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 218-232. Springer, Heidelberg (2005) (to appear in Journal of Computer and System Sciences)
16. Moran, S., Snir, S.: Efficient approximation of convex recolorings. Journal of Computer and System Sciences 73(7), 1078-1089 (2007)
17. Moran, S., Snir, S., Sung, W.-K.: Partial convex recolorings of trees and galled networks: Tight upper and lower bounds (February 2007) (manuscript)
18. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)
19. Ponta, O.: The Fixed-Parameter Approach to the Convex Recoloring Problem. Diplomarbeit, Mathematisches Institut, Ruprecht-Karls-Universität. Springer, Heidelberg (2007)
20. O(k)poly(n) algorithm for the parameterized convex recoloring problem. Information Processing Letters 104(2), 53-58 (2007)