Search
Abstract
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.
Citations
-
8
CrossRef
-
0
Web of Science
-
1 4
Scopus
Authors (3)
-
Hanna Furmańczyk
- Instytut Informatyki UG
Cite as
Full text
download paper
downloaded 64 times
- Publication version
- Accepted or Published Version
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Archives of Control Sciences
no. 26,
pages 281 - 295,
ISSN: 1230-2384 - Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Furmańczyk H., Jastrzębski A., Kubale M.: Equitable coloring of graphs. Recent theoretical results and new practical algorithms// Archives of Control Sciences. -Vol. 26., iss. 3 (2016), s.281-295
- DOI:
- Digital Object Identifier (open in new tab) 10.1515/acsc-2016-0016
- Verified by:
- Gdańsk University of Technology
seen 197 times