Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs

DOI10.1016/j.ipl.2018.08.002zbMath1478.68204OpenAlexW2888513371WikidataQ129360340 ScholiaQ129360340MaRDI QIDQ1799604

G. Abrishami, Freydoon Rahbarnia

Publication date: 19 October 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.08.002

zbMATH Keywords

diametergraph algorithmsplanar graphefficient dominationweighted efficient domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On efficient domination for some classes of \(H\)-free bipartite graphs

Cites Work

• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
• The weighted perfect domination problem and its variants
• Perfect codes in graphs
• New Polynomial Cases of the Weighted Efficient Domination Problem
• Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs
• Independence and Efficient Domination on P₆-free Graphs
• Unnamed Item

This page was built for publication: Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs