Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11032| Title: | The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | perfect graphs,interval graphs,path cover,fixed-endpoint path cover,linear-time algorithms,distance-hereditary graphs,finding hamiltonian circuits,circular-arc graphs,disjoint paths,algorithm,cographs |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/11032 |
| ISSN: | 0178-4617 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Asdre-2010-The 1-Fixed-Endpoint.pdf | 805.44 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
