Add to ORKGW pierwszym rozdziale wprowadzamy podstawowe definicje i oznaczenia. W rozdziale drugim prezentujemy wyniki związane z klasycznym kolorowaniem grafów przedziałowych. Przedstawiamy dwa algorytmy: First Fit i algorytm Kiersteada-Trottera. Nasze wyniki zaprezentowane są w rozdziałach 3 i 4 i dotyczą kolorowania grafów przedziałowych z dodatkowymi ograniczeniami całkowitoliczbowymi. Przedstawione przez nas zagadnienia są szczególnymi przypadkami problemu kolorowania grafów z "pojemnościami", zdefiniowanego przez Leah Epstein.In the first chapter we introduce basic definitions and notations. In Chapter 2 we present results related to the online interval graph coloring. Special attention is given to two algorithms: First Fit and an optimal one, g...
Abstract. We explore the question how well we can color graphs in distributed models, especially in ...
AbstractAn edge-coloring of a graph G with colors 1,2,…,t is called an interval (t,1)-coloring if at...
Motivated by applications in optical networks and job scheduling, we consider the interval coloring ...
AbstractWe present an improved online algorithm for coloring interval graphs with bandwidth. This pr...
AbstractWe study online interval coloring problems with bandwidth. We are interested in some variant...
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online....
AbstractGiven a graph G=(V,E) with strictly positive integer weights ωi on the vertices i∈V, a k-int...
Given a set of intervals on the real line, an interval graph is de®ned by a set of vertices associat...
W pracy zostały zebrane znane wyniki trudności problemu max-kolorowania dla różnych klas grafów. Głó...
AbstractImproved bounds on the performance of the on-line graph coloring algorithm First-Fit on inte...
A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors...
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on t...
We study the online graph coloring problem restricted to the intersection graphs of intervals with l...
In the Intervalizing Coloured Graphs problem, one must decide for a given graph G = (V, E) with a pr...
In the Intervalizing Coloured Graphs problem, one must decide for a given graph G = (V, E) with a pr...
Abstract. We explore the question how well we can color graphs in distributed models, especially in ...
AbstractAn edge-coloring of a graph G with colors 1,2,…,t is called an interval (t,1)-coloring if at...
Motivated by applications in optical networks and job scheduling, we consider the interval coloring ...
AbstractWe present an improved online algorithm for coloring interval graphs with bandwidth. This pr...
AbstractWe study online interval coloring problems with bandwidth. We are interested in some variant...
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online....
AbstractGiven a graph G=(V,E) with strictly positive integer weights ωi on the vertices i∈V, a k-int...
Given a set of intervals on the real line, an interval graph is de®ned by a set of vertices associat...
W pracy zostały zebrane znane wyniki trudności problemu max-kolorowania dla różnych klas grafów. Głó...
AbstractImproved bounds on the performance of the on-line graph coloring algorithm First-Fit on inte...
A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors...
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on t...
We study the online graph coloring problem restricted to the intersection graphs of intervals with l...
In the Intervalizing Coloured Graphs problem, one must decide for a given graph G = (V, E) with a pr...
In the Intervalizing Coloured Graphs problem, one must decide for a given graph G = (V, E) with a pr...
Abstract. We explore the question how well we can color graphs in distributed models, especially in ...
AbstractAn edge-coloring of a graph G with colors 1,2,…,t is called an interval (t,1)-coloring if at...
Motivated by applications in optical networks and job scheduling, we consider the interval coloring ...