Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10813| Title: | Parallel algorithms for Hamiltonian problems on quasi-threshold graphs |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | parallel algorithms,quasi-threshold graphs,recognition,tree representation,hamiltonian cycles,hamiltonian completion number,complexity,recognition algorithm,cographs |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/10813 |
| ISSN: | 0743-7315 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nikolopoulos-2004-Parallel algorithms.pdf | 551.61 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
