# Piotr Borowiecki - Profil naukowy - MOST Wiedzy

## dr hab. inż. Piotr Borowiecki

### Adiunkt ze stop. nauk. dr hab.

Miejsce pracy
Gmach Elektroniki Telekomunikacji i Informatyki pokój 209
Telefon
(58) 347 19 56

### Wybrane publikacje

• #### Computational aspects of greedy partitioning of graphs

In this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...

Pełny tekst w serwisie zewnętrznym

• #### Distributed graph searching with a sense of direction

In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...

Pełny tekst w serwisie zewnętrznym

• #### New potential functions for greedy independence and coloring

A potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...

Pełny tekst w serwisie zewnętrznym

• 2019-04-16