New insights for power edge set problem

DOI10.1007/978-3-319-71150-8_17MaRDI QIDQ1699780zbMATH OpenOpenAlexFDO

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

Publication date 26 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71150-8_17

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Improved complexity for power edge set problem
• Complexity and lowers bounds for power edge set problem
• Complexity and inapproximability results for the power edge set problem
• The power edge set problem
• Parameterized power domination complexity

Cited in

(5)

• Improved complexity for power edge set problem
• Complexity and lowers bounds for power edge set problem
• Complexity and inapproximability results for the power edge set problem
• Power Edge Set and Zero Forcing Set remain difficult in cubic graphs
• The power edge set problem

This page was built for publication: New insights for power edge set problem

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