Please use this identifier to cite or link to this item:
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
ISSN: 0178-4617
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
Asdre-2010-The 1-Fixed-Endpoint.pdf805.44 kBAdobe PDFView/Open    Request a copy

This item is licensed under a Creative Commons License Creative Commons