This thesis deals with an approximation algorithm for finding edge-rankings of series-parallel graphs. An edge-ranking of a graph G is a labeling of its edges with positive integers such that every path between two edges ...

This thesis presents an efficient algorithm for finding an optimal I-vertex-coloring of a partial k-tree. An I-vertex-coloring of a graph G is defined as follows: for a positive integer I and a graph G with non-negative ...

The designer of an integrated circuit (IC) transforms a circuit description to a geometric description, called the VLSI layout. The task of converting the specification of an electrical circuit into a layout is called ...

In this thesis we present an efficient parallel algorithm for solving the generalized vertex-coloring (l-vertex-coloring) problem on partial k-trees. Let l be a positive integer, and let G be a graph with nonnegative ...

For abstracts please see full text