Repository logo

Browsing by Subject "graph coloring"

Filter results by typing the first few letters
Now showing 1 - 5 of 5
  • thumbnail.journal.alt
    Item type:Thesis, Access status: Restricted ,
    Indeks daltonisty różnych klas grafów
    (Data obrony: 2018-10-22) Szczecina, Katarzyna
    Wydział Matematyki Stosowanej
  • thumbnail.journal.alt
    Item type:Thesis, Access status: Restricted ,
    Kolorowanie wierzchołkowe wybranych struktur grafowych
    (Data obrony: 2017-03-21) Świątkowska, Dagmara
    Wydział Matematyki Stosowanej
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Model formalny dla problemu lokalizacji błędów w kodzie programu
    (Wydawnictwa AGH, 2007) Dereniowski, Dariusz; Kubale, Marek
    There are several criteria for testing program correctness. In this paper we deal with the problem of automatic software testing under the assumption that the set of tests (assertions) is given for selected blocks of code. We simplify the analysis by assuming that the program being tested contains exactly one bug, but this does not lead to loss of generality. We consider some practical aspects of the above problem and a graph-theoretical model in general as well as some chromatic aspects of a graph searching model in particular.
  • thumbnail.journal.alt
    Item type:Thesis, Access status: Restricted ,
    Programowanie całkowitoliczbowe w układaniu planu zajęć
    (Data obrony: 2014-10-30) Wawro, Paulina
    Wydział Matematyki Stosowanej
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Szeregowanie rozrzedzonych systemów zadań jednostkowych 1- i 2-procesowych w oknach czasowych
    (Wydawnictwa AGH, 2005) Giaro, Krzysztof; Kubale, Marek
    In the paper sparse systems of dedicated 1- and 2-processor tasks with unit execution times are considered. Polynomial-time algorithms based on dynamic programming are given. These algorithms allow finding optimal solutions with respect to broad range of criterion functions. The sparsity of a system is measured in terms of the number of edges in the corresponding scheduling graph. More precisely, we are focused on graphs whose cyclomatic number is bounded by a constant. Our algorithms invoke procedures for finding maximal matching in graphs.