Improved parameterized algorithms for mixed domination

DOI10.1007/978-3-030-27195-4_28MaRDI QIDQ6199025zbMATH OpenOpenAlexFDO

Authors Mingyu Xiao, Zimo Sheng

Publication date 23 February 2024

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-27195-4_28

zbMATH Keywords

branch-and-search algorithmgraph algorithmskernelizationmixed dominationparameterized algorithms

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Improved parameterized algorithms and kernels for mixed domination
• New algorithms for mixed dominating set
• Mixed Dominating Set: a parameterized perspective
• On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
• On the mixed domination problem in graphs

Cited in

(1)

• Upper and lower bounds on approximating weighted mixed domination

This page was built for publication: Improved parameterized algorithms for mixed domination

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