Please use this identifier to cite or link to this item:
http://edoc.bseu.by:8080/handle/edoc/85047
Title: | Graph сoloring: an exact algorithm based on preliminary vertex ordering |
Authors: | Zakrevskij, A. Vasilkova, I. |
Keywords: | graph coloring;computer experiments;графическая раскраска |
Issue Date: | 2001 |
Publisher: | Белорусский государственный экономический университет |
Language: | Английский |
Type: | Article |
Citation: | Zakrevskij, A. Graph сoloring: an exact algorithm based on preliminary vertex ordering / A. Zakrevskij, I. Vasilkova // Информационные сети, системы и технологии = Information Networks, Systems and Technologies : в 3 кн. Кн.1 : Труды международной конференции ICINASTe'2001, Минск, 2-4 октября 2001 г. : на англ. яз. / Ред.: А.Н. Морозевич [и др.]. - Мн. : БГЭУ, 2001. - С. 112-116. |
Abstract: | The well-known graph coloring problem is abundant logical inference are used for that, regarded in this paper. A new algorithm is suggested and investigate , based on fixing vertex ordering, which allows to minimize the o f which are given below run-time o f inner cycles. A series or computer experiments on a flow of pseudo-random graphs having up to thousand vertices was conducted to find dependencies of the run-time and the chromatic number on the number of vertices. The area of preferable application of the algorithm is estimated. |
URI: | http://edoc.bseu.by:8080/handle/edoc/85047 |
ISBN: | 985-426-692-3 |
Appears in Collections: | Информационные сети, системы и технологии = Information Networks, Systems and Technologies |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zakrevskij_A..pdf | 303.12 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.