Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10930| Title: | A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | perfect graphs,complement reducible graphs,cographs,cotree,path cover,fixed-endpoint path cover,linear-time algorithms,distance-hereditary graphs,circular-arc graphs,hamiltonian problems,interval-graphs |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/10930 |
| ISSN: | 0028-3045 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Asdre-2007-A linear-time algori.pdf | 207.96 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
