Location of Repository

Algorithms and NP - completeness results for coloring and path cover problems on perfect graphs

By Αικατερίνη Ασδρέ
Topics: Αλγόριθμοι, Χρωματισμός, Επικάλυψη με μονοπάτια, Πολυπλοκότητα, Τέλεια γραφήματα, Κλάσεις γραφημάτων, Algorithms, NP - completeness, Coloring, Path cover, Complexity, Perfect graphs, Graph classes
Publisher: University of Ioannina
Year: 2008
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10442/he... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.