AbstractThe minimum cut and minimum length linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NP-complete for general graphs and in P for trees. We present here two parallel algorithms for the CREW PRAM. The first solves the minimum length linear arrangement problem for trees and the second solves the minimum cut arrangement for trees. We prove that the first problem belongs to NC for trees, and the second problem is in NC for bounded degree trees. To the best of our knowledge, these are the first parallel algorithms for the minimum length and the minimum cut linear arrangement problems
This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple ra...
The Minimum Linear Arrangement problem (MinLA) consists in finding an ordering of the nodes of a wei...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...
AbstractThe minimum cut and minimum length linear arrangement problems usually occur in solving wiri...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
The subject of this thesis is the Minimum Linear Arrangement Problem, a classical problem in combina...
AbstractIn this paper we examine the problem of finding minimum cuts in finite graphs with the side ...
We present a simple and implementable algorithm that computes a minimum spanning tree of an undirect...
We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum c...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
AbstractWe find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to...
This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple ra...
The Minimum Linear Arrangement problem (MinLA) consists in finding an ordering of the nodes of a wei...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...
AbstractThe minimum cut and minimum length linear arrangement problems usually occur in solving wiri...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
The subject of this thesis is the Minimum Linear Arrangement Problem, a classical problem in combina...
AbstractIn this paper we examine the problem of finding minimum cuts in finite graphs with the side ...
We present a simple and implementable algorithm that computes a minimum spanning tree of an undirect...
We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum c...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
AbstractWe find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to...
This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple ra...
The Minimum Linear Arrangement problem (MinLA) consists in finding an ordering of the nodes of a wei...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...