Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

DOI10.1016/J.ENDM.2006.06.049MaRDI QIDQ3439454zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 5725105 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• Deeply asymmetric planar graphs

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

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