Change search
ReferencesLink to record
Permanent link

Direct link
Ordered coloring of grids and related graphs
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
Show others and affiliations
2012 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 444, 40-51 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2012. Vol. 444, 40-51 p.
Keyword [en]
Grid graph, Ordered coloring, Vertex ranking
National Category
Computer Science
URN: urn:nbn:se:kth:diva-112877DOI: 10.1016/j.tcs.2012.04.036ISI: 000306041700005OAI: diva2:587530

QC 20130502

Available from: 2013-01-14 Created: 2013-01-14 Last updated: 2013-05-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lampis, Michael
By organisation
Theoretical Computer Science, TCS
In the same journal
Theoretical Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 41 hits
ReferencesLink to record
Permanent link

Direct link