.

Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

LAUR Repository

Show simple item record

dc.contributor.author Abu-Khzam, Faisal N.
dc.contributor.author Fernau, Henning
dc.date.accessioned 2016-11-09T09:37:05Z
dc.date.available 2016-11-09T09:37:05Z
dc.date.copyright 2006 en_US
dc.identifier.issn 1571-0653 en_US
dc.identifier.uri http://hdl.handle.net/10725/4762
dc.language.iso en en_US
dc.title Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 200302941 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal Electronic Notes in Discrete Mathematics en_US
dc.journal.volume 25 en_US
dc.article.pages 1-6
dc.identifier.doi http://dx.doi.org/10.1016/j.endm.2006.06.049 en_US
dc.identifier.ctation 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. en_US
dc.author.email faisal.abukhzam@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url http://www.sciencedirect.com/science/article/pii/S1571065306000503 en_US
dc.orcid.id https://orcid.org/0000-0001-5221-8421


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search LAUR


Advanced Search

Browse

My Account