Search
Abstract
In this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified for the backbone coloring problem.
Authors (2)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Journal of Applied Computer Science
no. 22,
pages 19 - 30,
ISSN: 1507-0360 - Language:
- English
- Publication year:
- 2014
- Bibliographic description:
- Janczewski R., Turowski K.: The Backbone Coloring Problem for Small Graphs// Journal of Applied Computer Science. -Vol. 22., nr. 2 (2014), s.19-30
- Verified by:
- Gdańsk University of Technology
seen 122 times