Browsing Department of Informatics by Journals "Theoretical Computer Science"
Now showing items 1-4 of 4
(Journal article; Peer reviewed, 2020)A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph G has ...
(Journal article; Peer reviewed, 2020)
(Peer reviewed; Journal article, 2019)We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as Distance-r Dominating Set and Distance-r Independent ...
(Peer reviewed; Journal article, 2012)We identify an abstract language for component software based on process algebra. Besides the usual operators for sequential, alternative and parallel composition, it has primitives for instantiating components and for ...