| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:2-local 3/4-competitive algorithm for multicoloring hexagonal graphs
Authors:Šparl, Petra (Author)
Žerovnik, Janez (Author)
Files:URL http://dx.doi.org/10.1016/j.jalgor.2004.09.001
 
Language:English
Work type:Unknown ()
Typology:1.01 - Original Scientific Article
Organization:FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
Abstract: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. Frequency assignment problem can be abstracted asa multicoloring problem on a weighted hexagonal graph, where the weights represent the number of calls to be assigned at vertices. In this paper we present a distributed algorithm for multicoloring hexagonal graphs using only the local clique numbers ▫$omega_1(v)$▫ and ▫$omega_2(v)$▫ at each vertex v of the given hexagonal graph, which can be computed from local information available at thevertex. We prove the algorithm uses no more than ▫$4omega(G)/3$▫ colors for any hexagonal graph G, without explicitly computing the global clique number ▫$omega(G)$▫. We also prove that our algorithm is 2-local, i.e., the computation at a vertex v ▫$in$▫ G uses only information about the demands of vertices whose graph distance from v is less than or equal to 2.
Keywords:mathematics, graph theory, graph colouring, 2-local distributed algorithm, cellular networks, frequency planning
Year of publishing:2005
UDC:519.17
ISSN on article:0196-6774
COBISS_ID:9538582 Link is opened in a new window
NUK URN:URN:SI:UM:DK:BV6K7TAP
Views:1294
Downloads:58
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Misc.
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Journal of algorithms
Shortened title:J. algorithms
Publisher:Academic Press.
ISSN:0196-6774
COBISS.SI-ID:25704704 New window

Secondary language

Language:English
Keywords:matematika, teorija grafov, barvanje grafov, algoritem


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica