Kernelization and randomized Parameterized algorithms for Co-path Set problem

Qilong Feng, Qian Zhou and Jianxin Wang ()
Additional contact information
Qilong Feng: Central South University
Qian Zhou: Central South University
Jianxin Wang: Central South University

Journal of Combinatorial Optimization, 2016, vol. 32, issue 1, No 5, 67-78

Abstract: 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.

Keywords: Co-path Set; Kernelization; Randomized algorithm (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9901-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9901-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9901-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().