Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/26671| Title: | An O(n)-time algorithm for the paired-domination problem on permutation graphs |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Η/Υ & Πληροφορικής |
| Keywords: | Permutation graphs,,Paired-domination,Domination,Algorithms,Complexity. |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/26671 |
| Publisher: | Springer Berlin / Heidelberg |
| Book name: | - |
| Appears in Collections: | Μονογραφίες ( Κλειστές) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs.pdf | 353.16 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
