Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2011: Computing and Combinatorics pp 110–121Cite as

Cograph Editing: Complexity and Parameterized Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6842))

Abstract

Cograph Editing is to find for a given graph G = (V,E) a set of at most k edge additions and deletions that transform G into a cograph. The computational complexity of this problem was open in the past. In this paper, we show that this problem is NP-hard, and present a parameterized algorithm based on a refined search tree technique with a running time of O(4.612k + |V|4.5)), which improves the trivial algorithm of running time O(6k + |V|4.5).

This research was supported in part by the National Natural Science Foundation of China under Grant No.61070224 and No.61073036, the Research Project of Hunan Provincial Education Department under Grant No.10C0938, and the DFG Cluster of Excellence “Multimodal Computing and Interaction (MMCI)”.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asdre, K., Nikolopoulos, S.D., Papadopoulos, C.: An optimal parallel solution for the path cover problem on P 4-sparse graphs. Journal of Parallel and Distributed Computing 67(1), 63–76 (2007)

    Article  MATH  Google Scholar 

  2. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Applied Mathematics 154(13), 1824–1844 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–196 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  5. Corneil, G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14(4), 926–934 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  9. Guillemot, S., Paul, C., Perez, A.: On the (Non-)existence of polynomial kernels for p l -free edge modification problems. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 147–157. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  11. Hoàng, C.T.: Perfect graphs. PhD Thesis, School of Computer Science. McGill University, Montreal (1985)

    Google Scholar 

  12. Jamison, B., Olariu, S.: Recognizing P 4-sparse graphs in linear time. SIAM Journal on Computing 21(2), 381–406 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mancini, F.: Graph Modification Problems Related to Graph Classes. PhD Thesis, University of Bergen (2008)

    Google Scholar 

  14. McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Mathematics 201(1-3), 189–241 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  16. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics 113(1), 109–128 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter tractable algorithms. Information Processing Letters 73, 125–129 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  19. Seinsche, D.: On a property of the class of n-colorable graphs. Journal of Combinatorial Theory, Series B 16, 191–193 (1974)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Computer Science, Hunan Normal University, Changsha, 410013, P.R. China

    Yunlong Liu

  2. School of Information Science and Engineering, Central South University, Changsha, 410083, P.R. China

    Jianxin Wang & Jianer Chen

  3. Universität des Saarlandes, Campus E 1.7, D-66123, Saarbrücken, Germany

    Jiong Guo

  4. Department of Computer Science and Engineering, Texas A&M University, College Station, TX, 77843, USA

    Jianer Chen

Authors
  1. Yunlong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas-Pan American, 78539, Edinburg, TX, USA

    Bin Fu

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Wang, J., Guo, J., Chen, J. (2011). Cograph Editing: Complexity and Parameterized Algorithms. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22685-4_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22684-7

  • Online ISBN: 978-3-642-22685-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation