Information Processing Letters
A simple parallel tree contraction algorithm
Journal of Algorithms
Optimal node ranking of trees in linear time
Information Processing Letters
The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
An introduction to parallel algorithms
An introduction to parallel algorithms
On a graph partition problem with application to VLSI layout
Information Processing Letters
Generalized vertex-rankings of trees
Information Processing Letters
SIAM Journal on Discrete Mathematics
On the vertex ranking problem for trapezoid, circular-arc and other graphs
Discrete Applied Mathematics
Algorithms for generalized vertex-rankings of partial k-trees
Theoretical Computer Science - computing and combinatorics
Vertex Ranking of Asteroidal Triple-Free Graphs
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
| Hi-index | 0.89 |
For a positive integer c, a c-vertex-ranking of a graph G=(V,E) is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels i leaves connected components, each having at most c vertices with label i. The c-vertex-ranking problem is to find a c-vertex-ranking of a given graph using the minimum number of ranks. In this paper we give an optimal parallel algorithm for solving the c-vertex-ranking problem on trees in O(log"2n) time using linear number of operations on the EREW PRAM model.