Connected coloring completion for general graphs: Algorithms and complexity

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

Volumn 4598 LNCS, Issue , 2007, Pages 75-85

  Chor, Benny ^a   Fellows, Michael ^b,c   Ragan, Mark A ^d   Razgon, Igor ^e   Rosamond, Frances ^b   Snir, Sagi ^f  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c DURHAM UNIVERSITY   (United Kingdom)

^d UNIVERSITY OF QUEENSLAND   (Australia)

^e UNIVERSITY COLLEGE CORK   (Ireland)

^f UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

CONVEX COLORING;

COMPUTER GRAPHICS;

EID: 37849005778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_10     Document Type: Conference Paper

References (23)

1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308-340 (1991)
2. Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM 42, 844-856 (1995)
3. Bodlaender, H.L., Fellows, M., Langsten, M., Ragan, M.A., Rosamond, F., Weyer, M.: Quadratic kernelization for convex recoloring of trees. Proceedings COCOON 2007, these proceedings (2007)
4. Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 55-68. Springer, Heidelberg (2006)
5. Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively generated graph families. Algorithmica 7, 555-581 (1992)
6. Bodlaender, H.L., Weyer, M.: Convex anc connected recolourings of trees and graphs. Manuscript (2005)
7. Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443-2450 (2003)
8. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. In: Proceedings of the 19th Annual IEEE Conference on Computational Complexity, pp. 150-160. IEEE Computer Society Press, Los Alamitos (2004)
9. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12-75 (1990)
10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
12. Fellows, M., Giannopoulos, P., Knauer, C., Paul, C., Rosamond, F., Whitesides, S., Yu, N.: The lawnmower and other problems: applications of MSO logic in geometry, Manuscript (2007)
13. Gramm, J., Nickelsen, A., Tantau, T.: Fixed-parameter algorithms in phylogenetics. Manuscript (2006)
14. Huson, D.H., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Mol. Biol. E 23, 254-267 (2006)
15. Huson, D.H.: SplitsTree: a program for analyzing and visualizing evolutionary data. Bioinfomatics 14, 68-73 (1998)
16. Kelley, B.P., Sharan, R., Karp, R.M., Sittler, T., Root, D.E., Stockwell, B.R., Ideker, T.: Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proc. Natl. Acad. Sci. USA 100, 11394-11399 (2003)
17. Moran, S., Snir, S.: Convex recolorings of strings and trees: definitions, hardness results and algorithms. To appear in Journal of Computer and System Sciences. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 218-232. Springer, Heidelberg (2005) A preliminary version appeared
18. Moran, S., Snir, S., Sung, W.: Partial convex recolorings of trees and galled networks. Manuscript (2006)
19. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)
20. Ramadan, E., Tarafdar, A., Pothen, A.: A hypergraph model for the yeast protein complex network. Fourth IEEE International Workshop on High Performance Computational Biology, Santa Fe, NM, April 26, 2004. IEEE Computer Society Press, Los Alamitos (2004)
21. Rual, J.F., Venkatesan, K., Hao, T., Hirozane-Kishikawa, T., Dricot, A., Li, N., Berriz, G.F., Gibbons, F.D., Dreze, M., Ayivi-Guedehoussou, N., Klitgord, N., Simon, C., Boxem, M., Milstein, S., Rosenberg, J., Goldberg, D.S., Zhang, L.V., Wong, S.L., Franklin, G., Li, S., Albala, J.S., Lim, J., Fraughton, C., Llamosas, E., Cevik, S., Bex, C., Lamesch, P., Sikorski, R.S., Vandenhaute, J., Zoghbi, H.Y., Smolyar, A., Bosak, S., Sequerra, R., Doucette-Stamm, L., Cusick, M.E., Hill, D.E., Roth, F.P., Vidal, M.: Nature, 437, 1173-1178 (2005)
22. Schwikowski, B., Uetz, P., Fields, S.: A network of protein-protein interactions in yeast. Nature Biotechnology 18(12), 1257-1261 (2000)
23. Viveshwara, S., Brinda, K.V., Kannan, N.: Protein structure: insights from graph theory. J. Theoretical and Computational Chemistry 1, 187-211 (2002)