Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

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...

Full description

Bibliographic Details
Main Authors: Furmańczyk Hanna, Jastrzębski Andrzej, Kubale Marek
Format: Article
Language:English
Published: Polish Academy of Sciences 2016-09-01
Series:Archives of Control Sciences
Subjects:
computer experiments
corona graph
equitable chromatic number
equitable coloring conjectures
NP-hardness
polynomial heuristics
Online Access:http://www.degruyter.com/view/j/acsc.2016.26.issue-3/acsc-2016-0016/acsc-2016-0016.xml?format=INT
id doaj-0c18a5e513584404a977b83a93948861
record_format Article
spelling doaj-0c18a5e513584404a977b83a939488612020-11-25T03:23:48ZengPolish Academy of SciencesArchives of Control Sciences2300-26112016-09-0126328129510.1515/acsc-2016-0016acsc-2016-0016Equitable Coloring of Graphs. Recent Theoretical Results and New Practical AlgorithmsFurmańczyk Hanna0Jastrzębski Andrzej1Kubale Marek2Institute of Informatics, Gdańsk University of Technology, Wita Stwosza 57, 80-952 Gdańsk, PolandDepartment of Algorithms and System Modeling, Gdańsk University of Technology, Narutowicza 11/12, 80-233 Gdańsk, PolandDepartment of Algorithms and System Modeling, Gdańsk University of Technology, Narutowicza 11/12, 80-233 Gdańsk, PolandIn 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.http://www.degruyter.com/view/j/acsc.2016.26.issue-3/acsc-2016-0016/acsc-2016-0016.xml?format=INTcomputer experimentscorona graphequitable chromatic numberequitable coloring conjecturesNP-hardnesspolynomial heuristics
collection DOAJ
language English
format Article
sources DOAJ
author Furmańczyk Hanna
Jastrzębski Andrzej
Kubale Marek
spellingShingle Furmańczyk Hanna
Jastrzębski Andrzej
Kubale Marek
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Archives of Control Sciences
computer experiments
corona graph
equitable chromatic number
equitable coloring conjectures
NP-hardness
polynomial heuristics
author_facet Furmańczyk Hanna
Jastrzębski Andrzej
Kubale Marek
author_sort Furmańczyk Hanna
title Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
title_short Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
title_full Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
title_fullStr Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
title_full_unstemmed Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
title_sort equitable coloring of graphs. recent theoretical results and new practical algorithms
publisher Polish Academy of Sciences
series Archives of Control Sciences
issn 2300-2611
publishDate 2016-09-01
description 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.
topic computer experiments
corona graph
equitable chromatic number
equitable coloring conjectures
NP-hardness
polynomial heuristics
url http://www.degruyter.com/view/j/acsc.2016.26.issue-3/acsc-2016-0016/acsc-2016-0016.xml?format=INT
work_keys_str_mv AT furmanczykhanna equitablecoloringofgraphsrecenttheoreticalresultsandnewpracticalalgorithms
AT jastrzebskiandrzej equitablecoloringofgraphsrecenttheoreticalresultsandnewpracticalalgorithms
AT kubalemarek equitablecoloringofgraphsrecenttheoreticalresultsandnewpracticalalgorithms
_version_ 1724604514306097152

Similar Items