Randomized parameterized algorithms for co-path set problem

DOI10.1007/978-3-319-08016-1_8MaRDI QIDQ3188837zbMATH OpenOpenAlexFDO

Authors Qilong Feng, Qian Zhou, Shao-Hua Li

Publication date 2 September 2014

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08016-1_8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Recommendations

• Kernelization and randomized parameterized algorithms for co-path set problem
• A fast parameterized algorithm for co-path set
• Randomized parameterized algorithms for P₂-packing and co-path packing problems
• Random methods for parameterized problems
• Narrow sieves for parameterized paths and packings

Cited in

(6)

• Faster deterministic algorithm for \textsc{Co-Path Set}
• Kernelization and randomized parameterized algorithms for co-path set problem
• Smaller kernels for several FPT problems based on simple observations
• A fast parameterized algorithm for co-path set
• A survey of parameterized algorithms and the complexity of edge modification
• The MASEMPR problem and its applications in logistics

This page was built for publication: Randomized parameterized algorithms for co-path set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188837)