Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10931| Title: | NP-completeness results for some problems on subclasses of bipartite and chordal graphs |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | harmonious coloring,pair-complete coloring,k-path partition,bipartite permutation graphs,convex graphs,quasi-threshold graphs,threshold graphs,np-completeness,achromatic number,threshold graphs,complexity,algorithms,trees |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/10931 |
| ISSN: | 0304-3975 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Asdre-2007-NP-completeness resu.pdf | 703.13 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
