Ordered Coloring Grids and Related Graphs

Bar-Noy, A; Cheilaris, P; Lampis, M; Mitsou, V; Zachos, S

dc.contributor.author	Bar-Noy, A	en
dc.contributor.author	Cheilaris, P	en
dc.contributor.author	Lampis, M	en
dc.contributor.author	Mitsou, V	en
dc.contributor.author	Zachos, S	en
dc.date.accessioned	2014-03-01T02:51:53Z
dc.date.available	2014-03-01T02:51:53Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35724
dc.subject	Cellular Network	en
dc.subject	Chromatic Number	en
dc.subject	Frequency Assignment	en
dc.subject	Upper and Lower Bounds	en
dc.title	Ordered Coloring Grids and Related Graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-11476-2_4	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-11476-2_4	en
heal.publicationDate	2009	en
heal.abstract	Abstract We investigate a coloring problem, called ordered coloring, in grids and some other families of grid-like graphs. Ordered coloring (also known,as vertex ranking) is related to conflict-free coloring and other traditional coloring problems. Such coloring problems can model (among others) efficient frequency assignments in cellular networks. Our main technical results improve upper and lower bounds for the ordered chromatic	en
heal.journalName	Colloquium on Structural Information & Communication Complexity	en
dc.identifier.doi	10.1007/978-3-642-11476-2_4	en