IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i1d10.1007_s10878-015-9901-y.html
   My bibliography  Save this article

Kernelization and randomized Parameterized algorithms for Co-path Set problem

Author

Listed:
  • Qilong Feng

    (Central South University
    Hunan Engineering Center for Currency Recognition and Self-Service)

  • Qian Zhou

    (Central South University
    Hunan Engineering Center for Currency Recognition and Self-Service)

  • Jianxin Wang

    (Central South University
    Hunan Engineering Center for Currency Recognition and Self-Service)

Abstract

Co-path Set problem is of important applications in mapping unique DNA sequences onto chromosomes and whole genomes. Given a graph G, the parameterized version of Co-path Set problem is to find a subset F of edges with size at most k such that each connected component in $$G[E\backslash F]$$ G [ E \ F ] is a path. In this paper, we give a kernel of size 6k and a randomized algorithm of running time $$O^*(2.17^k)$$ O ∗ ( 2 . 17 k ) for the Parameterized Co-path Set problem. The randomized methods developed in the paper are of great promising to be applied to other branch-based algorithms.

Suggested Citation

  • Qilong Feng & Qian Zhou & Jianxin Wang, 2016. "Kernelization and randomized Parameterized algorithms for Co-path Set problem," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 67-78, July.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9901-y
    DOI: 10.1007/s10878-015-9901-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9901-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9901-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9901-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.