Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

DOI10.1016/J.ENDM.2006.06.049zbMath1134.68371OpenAlexW2055671656MaRDI QIDQ3439454

Faisal N. Abu-Khzam, Henning Fernau

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.049

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Deeply asymmetric planar graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs