Andrzej Jastrzębski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Andrzej Jastrzębski has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Hanna Furmańczyk
Institute of Informatics Faculty of Mathematics Physics and Informatics University of Gdańsk Gdańsk Poland
1 shared publication - Marek Kubale
Dept. of Algorithms and System Modeling Gdańsk University of Technology Gdańsk Poland
1 shared publication - Tomasz Dzido
Gdynia Maritime University
1 shared publication
Latest Publications
- 1 April 2018
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (4) , 1150-1154
Turán numbers for odd wheels
- 1 April 2018
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (4) , 1150-1154
Turán numbers for odd wheels
- Open Access
- 1 September 2016
- Published by Walter de Gruyter GmbH in Archives of Control Sciences
- Vol. 26 (3) , 281-295
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. 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
- 1 September 2016
- Published by Walter de Gruyter GmbH in Archives of Control Sciences
- Vol. 26 (3) , 281-295
Open AccessEquitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. 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