Cograph editing: Complexity and parameterized algorithms

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

Volumn 6842 LNCS, Issue , 2011, Pages 110-121

  Liu, Yunlong ^a   Wang, Jianxin ^b   Guo, Jiong ^c   Chen, Jianer ^b,d  

^a HUNAN NORMAL UNIVERSITY   (China)

^b CENTRAL SOUTH UNIVERSITY   (China)

^c SAARLAND UNIVERSITY   (Germany)

^d Texas A and M University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COGRAPH; EDGE ADDITION; GRAPH G; NP-HARD; PARAMETERIZED ALGORITHM; RUNNING TIME; SEARCH TREES; COGRAPH EDITING;

ALGORITHMS; COMBINATORIAL MATHEMATICS; TREES (MATHEMATICS); COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

EID: 80051991347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22685-4_10     Document Type: Conference Paper

References (19)

1. 4-sparse graphs. Journal of Parallel and Distributed Computing 67(1), 63-76 (2007)
2. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Applied Mathematics 154(13), 1824-1844 (2006)
3. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171-196 (1996)
4. Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 459-468. Springer, Heidelberg (2010)
5. Corneil, G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14(4), 926-934 (1985)
6. El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Transactions on Circuits and Systems 35(3), 354-362 (1988)
7. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4), 321-347 (2004)
8. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems 38(4), 373-392 (2005)
9. Guillemot, S., Paul, C., Perez, A.: On the (Non-)existence of polynomial kernels for Pl-free edge modification problems. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 147-157. Springer, Heidelberg (2010)
10. Guo, J., Hüffner, F., Komusiewicz, C., Zhang, Y.: Improved algorithms for bicluster editing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 445-456. Springer, Heidelberg (2008)
11. Hoàng, C.T.: Perfect graphs. PhD Thesis, School of Computer Science. McGill University, Montreal (1985)
12. 4-sparse graphs in linear time. SIAM Journal on Computing 21(2), 381-406 (1992)
13. Mancini, F.: Graph Modification Problems Related to Graph Classes. PhD Thesis, University of Bergen (2008)
14. McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Mathematics 201(1-3), 189-241 (1999)
15. Nastos, J., Gao, Y.: A novel branching strategy for parameterized graph modification problems. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol. 6509, pp. 332-346. Springer, Heidelberg (2010)
16. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics 113(1), 109-128 (2001)
17. Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter tractable algorithms. Information Processing Letters 73, 125-129 (2000)
18. Protti, F., Silva, M.D., Szwarcfiter, J.L.: Applying Modular Decomposition to Parameterized Cluster Editing Problems. Theory of Computing Systems 44, 91-104 (2009)
19. Seinsche, D.: On a property of the class of n-colorable graphs. Journal of Combinatorial Theory, Series B 16, 191-193 (1974)