Faster deterministic algorithm for \textsc{Co-Path Set}

DOI10.1016/J.IPL.2022.106335OpenAlexW4302773515MaRDI QIDQ2680227

Dekel Tsur

Publication date: 30 January 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106335

zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Kernelization and randomized parameterized algorithms for co-path set problem
• Improved kernel results for some FPT problems based on simple observations
• Parameterized algorithmics for linear arrangement problems
• Radiation hybrid map construction problem parameterized
• A Fast Parameterized Algorithm for Co-Path Set

This page was built for publication: Faster deterministic algorithm for \textsc{Co-Path Set}