Assignment of Reusable and Non-Reusable Frequencies

Migdalas, A; Fotakis, D; Pardalos, P; Spirakis, P; Burkard, R

dc.contributor.author	Migdalas, A	en
dc.contributor.author	Fotakis, D	en
dc.contributor.author	Pardalos, P	en
dc.contributor.author	Spirakis, P	en
dc.contributor.author	Burkard, R	en
dc.date.accessioned	2014-03-01T01:46:40Z
dc.date.available	2014-03-01T01:46:40Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24987
dc.subject	Frequency Assignment	en
dc.title	Assignment of Reusable and Non-Reusable Frequencies	en
heal.type	journalArticle	en
heal.publicationDate	1998	en
heal.abstract	Graph radio coloring and graph radio labelling are combinatorial models fortwo interesting cases of Frequency Assignment. In both problems positiveinteger labels (channels) must be assigned to all the vertices of a graphsuch that adjacent vertices get labels at distance at least two. In radiolabelling all the labels must be distinct, while in radio coloring only thevertices being at distance no	en