Parameterized algorithms for power edge set and zero forcing set

DOI10.1007/978-3-031-98740-3_25MaRDI QIDQ6876380zbMATH OpenFDO

Authors Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-98740-3_25

zbMATH Keywords

neighborhood diversityparameterized algorithmsPMU placement problempower edge settree-widthzero forcing set

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A faster algorithm for vertex cover parameterized by solution size
• Algorithmic meta-theorems for restrictions of treewidth
• Complexity and inapproximability results for the power edge set problem
• Complexity and lowers bounds for power edge set problem
• Domination in Graphs Applied to Electric Power Networks
• Improved algorithms and complexity results for power domination in graphs
• Observing the state of a smart grid using bilevel programming
• Power Edge Set and Zero Forcing Set remain difficult in cubic graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The PMU Placement Problem
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: Parameterized algorithms for power edge set and zero forcing set

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