Back to search

University of Ioannina

Αλγόριθμοι και αποτελέσματα NP-πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα

Abstract

dc:description

This work focuses on the complexity status of path cover and coloring problems on classes of perfect graphs. In particular, it deals with designing and analyzing graph algorithms for these problems or, for the cases where this is not possible, with providing NP-completeness results. Most of our results have already been published. We next describe the variations of the path cover and coloring problems that we study in this work. […]

Degree

thesis:*
Grantor dc:publisher
University of Ioannina
Year dc:date
2008

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Asdre, Katerina
  • Ασδρέ, Αικατερίνη

Subjects

dc:subject × 17

Rights

Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/17553

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Asdre, Katerina; Ασδρέ, Αικατερίνη. Αλγόριθμοι και αποτελέσματα NP-πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα. University of Ioannina, 2008. http://hdl.handle.net/10442/hedi/17553