.

Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

LAUR Repository

Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

Abu-Khzam, Faisal N.; Fernau, Henning; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb
URI: http://hdl.handle.net/10725/4762
URL: http://www.sciencedirect.com/science/article/pii/S1571065306000503
DOI: http://dx.doi.org/10.1016/j.endm.2006.06.049

Citation:

Khzam, F. N. A., & Fernau, H. (2006). Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. Electronic Notes in Discrete Mathematics, (25), 1-6.

Access Status:

N/A

Show full item record

Files in this item

Icon
Name: Parameterized.pdf
Size: 63.92Kb
Format: PDF

This item appears in the following Collection(s)

Search LAUR


Advanced Search

Browse

My Account