.

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
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
Date: 2016-11-09
Terms of Use: This item is made available under the terms and conditions applicable to " Article ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

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

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Search LAUR


Advanced Search

Browse

My Account