Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

A fast branching algorithm for cluster vertex deletion

Tools
- Tools
+ Tools

Boral, Anudhyan, Cygan, Marek, Kociumaka, Tomasz and Pilipczuk, Marcin (2014) A fast branching algorithm for cluster vertex deletion. In: Hirsch, Edward A. and Kuznetsov, Sergei O. and Pin , Jean Eric and Vereshchagin, Nikolai Konstantinovich, 1958-, (eds.) Computer Science - Theory and Applications: Proceedings of 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Lecture Notes in Computer Science (8476). Berlin: Springer International, pp. 111-124. ISBN 9783319066851

[img]
Preview
PDF
WRAP_1371795-cs-270115-cluster-vd.pdf - Accepted Version - Requires a PDF viewer.

Download (534Kb) | Preview
Official URL: http://dx.doi.org/10.1007/978-3-319-06686-8_9

Request Changes to record.

Abstract

In the family of clustering problems we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques).
Hüffner et al. [LATIN 2008, Theory Comput. Syst. 2010] initiated the parameterized study of Cluster Vertex Deletion, where the allowed modification is vertex deletion, and presented an elegant O(2kk9+nm)-time fixed-parameter algorithm, parameterized by the solution size. In the last 5 years, this algorithm remained the fastest known algorithm for Cluster Vertex Deletion and, thanks to its simplicity, became one of the textbook examples of an application of the iterative compression principle. In our work we break the 2 k -barrier for Cluster Vertex Deletion and present an O(1.9102k(n+m))-time branching algorithm.

Item Type: Book Item
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Cluster analysis
Series Name: Lecture Notes in Computer Science
Publisher: Springer International
Place of Publication: Berlin
ISBN: 9783319066851
ISSN: 0302-9743
Book Title: Computer Science - Theory and Applications: Proceedings of 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014
Editor: Hirsch, Edward A. and Kuznetsov, Sergei O. and Pin , Jean Eric and Vereshchagin, Nikolai Konstantinovich, 1958-
Official Date: 2014
Dates:
DateEvent
2014Published
Number: 8476
Page Range: pp. 111-124
DOI: 10.1007/978-3-319-06686-8_9
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 28 March 2016
Date of first compliant Open Access: 28 March 2016
Funder: Narodowe Centrum Nauki (NCN), Fundacja na rzecz Nauki Polskiej [Foundation for Polish Science] (FNP)
Grant number: N206567140 (NCN)

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us