Skip to main content
SpringerLink
Log in

Cluster Editing with Locally Bounded Modifications Revisited

  • Conference paper
Combinatorial Algorithms (IWOCA 2013)

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

Included in the following conference series:

  • 852 Accesses

Abstract

For Cluster Editing where both the number of clusters and the edit degree are bounded, we speed up the kernelization by almost a factor n compared to Komusiewicz and Uhlmann (2012), at cost of a marginally worse kernel size bound. We also give sufficient conditions for a subset of vertices to be a cluster in some optimal clustering.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Böcker, S.: A Golden Ratio Parameterized Algorithm for Cluster Editing. J. Discr. Algor. 16, 79–89 (2012)

    Article  MATH  Google Scholar 

  2. Böcker, S., Briesemeister, S., Klau, G.W.: Exact Algorithms for Cluster Editing: Evaluation and Experiments. Algorithmica 60, 316–334 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cao, Y., Chen, J.: Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica 64, 152–169 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, J., Meng, J.: A 2k Kernel for the Cluster Editing Problem. J. Comp. System Sci. 78, 211–220 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight Bounds for Parameterized Complexity of Cluster Editing. In: Portier, N., Wilke, T. (eds.) STACS 2013., Dagstuhl. LIPIcs, vol. 20, pp. 32–43 (2013)

    Google Scholar 

  6. Komusiewicz, C., Uhlmann, J.: Cluster Editing with Locally Bounded Modifications. Discr. Appl. Math. 160, 2259–2270 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Math. 6, 29–123 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Misra, J., Gries, D.: A Constructive Proof of Vizing’s Theorem. Info. Proc. Letters 41, 131–133 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truß, A., Böcker, S.: Exact and Heuristic Algorithms for Weighted Cluster Editing. In: Markstein, P., Xu, Y. (eds.) CSB 2007, pp. 391–401. Imperial College Press (2007)

    Google Scholar 

  10. Shamir, R., Sharan, R., Tsur, D.: Cluster Graph Modification Problems. Discr. Appl. Math. 144, 173–182 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Chalmers University, 41296, Göteborg, Sweden

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, LITIS, Université de Rouen, 76821, EA 4180, Mont Saint Aignan Cedex, France

    Thierry Lecroq  & Laurent Mouchard  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damaschke, P. (2013). Cluster Editing with Locally Bounded Modifications Revisited. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45278-9_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45277-2

  • Online ISBN: 978-3-642-45278-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation