Ordered coloring of 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:53:59Z
dc.date.available	2014-03-01T02:53:59Z
dc.date.issued	2012	en
dc.identifier.issn	03043975	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36511
dc.subject	Grid graph	en
dc.subject	Ordered coloring	en
dc.subject	Vertex ranking	en
dc.subject.other	Chromatic number	en
dc.subject.other	Coloring problems	en
dc.subject.other	Grid graphs	en
dc.subject.other	Grid-like	en
dc.subject.other	Sparse linear systems	en
dc.subject.other	Upper and lower bounds	en
dc.subject.other	Vertex-ranking	en
dc.subject.other	Linear systems	en
dc.subject.other	Coloring	en
dc.title	Ordered coloring of grids and related graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1016/j.tcs.2012.04.036	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.tcs.2012.04.036	en
heal.publicationDate	2012	en
heal.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) has applications, among other areas, in efficient solving of sparse linear systems of equations and scheduling parallel assembly of products. Our main technical results improve upper and lower bounds for the ordered chromatic number of grids and related graphs. © 2012 Elsevier B.V. All rights reserved.	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.doi	10.1016/j.tcs.2012.04.036	en
dc.identifier.volume	444	en
dc.identifier.spage	40	en
dc.identifier.epage	51	en