<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>2-local distributed algorithms for generalized coloring of hexagonal graphs</dc:title><dc:creator>Šparl,	Petra	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>barvanje grafov</dc:subject><dc:subject>aproksimacijski algoritem</dc:subject><dc:subject>frekvenčni načrt</dc:subject><dc:subject>▫$k$▫-lokalen porazdeljen algoritem</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>approximation algorithms</dc:subject><dc:subject>graph coloring</dc:subject><dc:subject>frequency planning</dc:subject><dc:subject>▫$k$▫-local distributed algorithm</dc:subject><dc:subject/><dc:description>A 2-local distributed approximation algorithm for multicoloring of a triangle-free hexagonal graph which uses at most ▫$lceil frac{5omega(G)}{4} rceil + 3$▫ colors is presented.</dc:description><dc:date>2005</dc:date><dc:date>2015-07-10 14:52:46</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51512</dc:identifier><dc:identifier>UDK: 519.174</dc:identifier><dc:identifier>OceCobissID: 16630105</dc:identifier><dc:identifier>COBISS_ID: 13826393</dc:identifier><dc:identifier>ISSN pri članku: 1571-0653</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:YYIWPDV7</dc:identifier><dc:language>sl</dc:language></metadata>
