The conversion set problem on graphs

DOI10.1016/J.PROCS.2023.08.227MaRDI QIDQ6885237zbMATH OpenFDO

Authors Isac Costa, Carlos Vinícius G. C. Lima, Thiago Marcilon

Publication date 11 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PROCS.2023.08.227

zbMATH Keywords

parameterized reductionreversible processestarget set selectiontreewidth

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(2)

• Parameterized complexity of the f-critical set problem
• The conversion set problem on graphs

This page was built for publication: The conversion set problem on graphs

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