| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434846 | Theoretical Computer Science | 2012 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
