Power Edge Set and Zero Forcing Set remain difficult in cubic graphs

DOI10.1007/978-3-030-25005-8_11MaRDI QIDQ2301739zbMATH OpenOpenAlexFDO

Authors Pierre Cazals, B. Darties, Rodolphe Giroudeau, Mathias Weller, Annie Chateau

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_11

zbMATH Keywords

complexityPower Edge SetsynchrophasorZero Forcing Set

Mathematics Subject Classification ID

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

Recommendations

• Complexity and computation of connected zero forcing
• New insights for power edge set problem
• Complexity and lowers bounds for power edge set problem
• Zero forcing in claw-free cubic graphs
• Zero forcing versus domination in cubic graphs

Cited in

(2)

• The power edge set problem
• Parameterized algorithms for power edge set and zero forcing set

This page was built for publication: Power Edge Set and Zero Forcing Set remain difficult in cubic graphs

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