An optimal parallel algorithm forc-vertex-ranking of trees
type: Item
instance of: scholarly article
title: An optimal parallel algorithm forc-vertex-ranking of trees
zbMATH Open document ID: 1173.68846
author: Md. Abul Kashem
author: M. Ziaur Rahman
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 5599153
zbMATH Keywords: ordered coloring
zbMATH Keywords: parallel algorithms
zbMATH Keywords: separator-tree
zbMATH Keywords: tree contraction
zbMATH Keywords: vertex-ranking
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.07.007
OpenAlex ID: W2044146506
cites work: A simple parallel tree contraction algorithm
cites work: Rankings of Graphs
cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs
cites work: Optimal node ranking of trees
cites work: Q4023519
cites work: Algorithms and Computation
cites work: Algorithms for generalized vertex-rankings of partial k-trees
cites work: Vertex ranking of asteroidal triple-free graphs
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: Optimal node ranking of tree in linear time
cites work: On a graph partition problem with application to VLSI layout
DOI: 10.1016/J.IPL.2004.07.007
Recommended article: Algorithms and Computation
Recommended article: An optimal parallel algorithm for node ranking of cographs
Recommended article: A simple optimal parallel algorithm for a core of a tree
Recommended article: An optimal parallel algorithm for computing furthest neighbors in a tree
Recommended article: Q4000686
Recommended article: Parallel Processing and Applied Mathematics
Recommended article: Parallel Algorithms with Optimal Speedup for Bounded Treewidth
Recommended article: Parallel algorithms with optimal speedup for bounded treewidth
Recommended article: Efficient parallel algorithms for some tree layout problems
description: scientific article; zbMATH DE number 5599153