Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13270Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Papadopoulos, C. | en |
| dc.date.accessioned | 2015-11-24T17:26:51Z | - |
| dc.date.available | 2015-11-24T17:26:51Z | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13270 | - |
| dc.rights | Default Licence | - |
| dc.subject | on-line coloring | en |
| dc.subject | first-fit algorithm | en |
| dc.subject | algorithms | en |
| dc.subject | permutation graphs | en |
| dc.subject | perfect graphs | en |
| dc.subject | combinatorial problems | en |
| dc.subject | online | en |
| dc.title | On the performance of the first-fit coloring algorithm on permutation graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.secondary | <Go to ISI>://000165067500006 | - |
| heal.identifier.secondary | http://ac.els-cdn.com/S0020019000001095/1-s2.0-S0020019000001095-main.pdf?_tid=a9dac96db8369f393e4bb6da6aac4516&acdnat=1339410025_4bf2e8c2168b8a47e38f9368d587d6a5 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2000 | - |
| heal.abstract | In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. We prove that the largest number of colors chi (FF)(G) that the First-Fit coloring algorithm (FF) needs on permutation graphs of chromatic number chi>(*) over bar * (G) = chi when taken over all possible vertex orderings is not linearly bounded in terms of the off-line optimum, if X is a fixed positive integer. Specifically, we prove that for any integers chi > 0 and k greater than or equal to 0, there exists a permutation graph G on n vertices such that chi>(*) over bar * (G) = chi and chi (FF)(G) greater than or equal to 1/2 ((chi (2) + chi) + k(chi (2) - chi)), for sufficiently large n. Our result shows that the class of permutation graphs P is not First-Fit X-bounded; that is, there exists no function f such that for all graphs G epsilon P, chi (FF)(G) less than or equal to f(omega>(*) over bar * (G)). Recall that for perfect graphs omega>(*) over bar * (G) = chi>(*) over bar * (G), where omega>(*) over bar * (G) denotes the clique number of G. (C) 2000 Elsevier Science B.V. All rights reserved. | en |
| heal.publisher | Elsevier | en |
| heal.journalName | Information Processing Letters | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nikolopoulos-2000-On the performance o.pdf | 406.35 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
