mgr inż. Andrzej Jastrzębski
Zatrudnienie
- Asystent w Katedra Algorytmów i Modelowania Systemów
Kontakt dla biznesu
- Lokalizacja
- Al. Zwycięstwa 27, 80-219 Gdańsk
- Telefon
- +48 58 348 62 62
- biznes@pg.edu.pl
Media społecznościowe
Kontakt
Asystent
- Miejsce pracy
-
Budynek A Elektroniki
pokój EA 238 otwiera się w nowej karcie - Telefon
- (58) 347 17 41
- jendrek@eti.pg.edu.pl
Wybrane publikacje
-
Turán numbers for odd wheels
The Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
Edge-coloring of 3-uniform hypergraphs
We consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
wyświetlono 2596 razy