An algorithm for 12-[5]coloring of triangle-free hexagonal graphs

被引：0

作者：

Zerovnik, J ^{[1
]}

机构：

[1] Univ Maribor, FME, SI-2000 Maribor, Slovenia

来源：

ITI 2005: PROCEEDINGS OF THE 27TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES | 2005年

关键词：

graph theory; approximation algorithm; graph coloring; frequency allocation; cellular networks; distributed algorithm;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

An important optimization problem in the design of cellular networks is to assign sets of frequencies to transmitters to avoid unacceptable interference. A cellular network is generally modeled as a subgraph of the infinite triangular lattice. The distributed frequency assignment problem can be abstracted as a multicoloring problem on a weighted hexagonal graph, where the weight vector represents the number of calls to be assigned at vertices. In this paper we present a distributed algorithm for 12-[5]coloring of triangle-free hexagonal graphs.

引用

页码：673 / 678

页数：6

共 13 条

[1] FREQUENCY ASSIGNMENT - THEORY AND APPLICATIONS [J].