Despite the variety of graph coloring models discussed in published papers of a theoretical
nature, the classical model remains one of the most significant and widely applied in practice…

For a given approximate coloring algorithm a graph is said to be slightly hard-to-color (SHC)
if some implementation of the algorithm uses more colors than the chromatic number. …

: Let A(G) be the number of colors used by algorithm to color the vertices of graph G. A
graph G is said to be hard-to-color (HC) (resp. slightly HC) if for every (resp. some) …

For a given approximate coloring algorithm a graph G is said to be hard-to-color (HC) if
every implementation of the algorithm uses more colors than the chromatic number. For a …

Rozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach pro-stych. Oprócz
podstawowych definicji podane zostały najczęściej stosowanemetody przybliżone oraz …

Graph coloring is one of the oldest and best-known problems of graph theory. Statistics show
that graph coloring is one of the central issues in the collection of several hundred classical …

We present a multi-camera 3D pedestrian detection method that does not need to train using
data from the target scene. We estimate pedestrian location on the ground plane using a …

We compare results of selected algorithms that approximate the independence number in
terms of the quality of constructed solutions. Furthermore, we establish smallest hard-to-…

Combinatorial optimization (CO) has significant theoretical and practical implications. CO
problems are naturally discrete, making typical machine-learning techniques based on …

Historical cities around the world have serious traffic congestions due to old infrastructure
and urbanization. To mitigate traffic problems in such cities, infrastructure investments are …