Publication date
September 1995
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractImproved bounds on the performance of the on-line graph coloring algorithm First-Fit on interval graphs are obtained
AbstractImproved bounds on the performance of the on-line graph coloring algorithm First-Fit on interval graphs are obtained
The First-Fit (or Grundy) chromatic number of G, written as χF F (G), is defined as the maximum numb...
AbstractThe first-fit chromatic number of a graph is the number of colors needed in the worst case o...
An edge-coloring of a graph G with consecutive integers c1,…,ct is called an interval t-coloring, if...
AbstractImproved bounds on the performance of the on-line graph coloring algorithm First-Fit on inte...
abstract: Graph coloring is about allocating resources that can be shared except where there are cer...
One of the simplest heuristics for obtaining a proper coloring of a graph is the first-fit algorithm...
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on t...
Given a set of intervals on the real line, an interval graph is de®ned by a set of vertices associat...
AbstractWe study the performance of the algorithms First −Fit and Next −Fit for two online edge colo...
AbstractGiven a graph G=(V,E) with strictly positive integer weights ωi on the vertices i∈V, a k-int...
Instance of the on-line graph coloring problem is a graph together with a permutation of its vertice...
AbstractThis paper is the first article in a series devoted to the study of the following general pr...
AbstractAn edge-coloring of a graph G with colors 1,2,…,t is called an interval (t,1)-coloring if at...
W pierwszym rozdziale wprowadzamy podstawowe definicje i oznaczenia. W rozdziale drugim prezentujemy...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
The First-Fit (or Grundy) chromatic number of G, written as χF F (G), is defined as the maximum numb...
AbstractThe first-fit chromatic number of a graph is the number of colors needed in the worst case o...
An edge-coloring of a graph G with consecutive integers c1,…,ct is called an interval t-coloring, if...
AbstractImproved bounds on the performance of the on-line graph coloring algorithm First-Fit on inte...
abstract: Graph coloring is about allocating resources that can be shared except where there are cer...
One of the simplest heuristics for obtaining a proper coloring of a graph is the first-fit algorithm...
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on t...
Given a set of intervals on the real line, an interval graph is de®ned by a set of vertices associat...
AbstractWe study the performance of the algorithms First −Fit and Next −Fit for two online edge colo...
AbstractGiven a graph G=(V,E) with strictly positive integer weights ωi on the vertices i∈V, a k-int...
Instance of the on-line graph coloring problem is a graph together with a permutation of its vertice...
AbstractThis paper is the first article in a series devoted to the study of the following general pr...
AbstractAn edge-coloring of a graph G with colors 1,2,…,t is called an interval (t,1)-coloring if at...
W pierwszym rozdziale wprowadzamy podstawowe definicje i oznaczenia. W rozdziale drugim prezentujemy...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
The First-Fit (or Grundy) chromatic number of G, written as χF F (G), is defined as the maximum numb...
AbstractThe first-fit chromatic number of a graph is the number of colors needed in the worst case o...
An edge-coloring of a graph G with consecutive integers c1,…,ct is called an interval t-coloring, if...
Add to ORKG