An optimal parallel algorithm forc-vertex-ranking of trees

DOI10.1016/j.ipl.2004.07.007zbMath1173.68846OpenAlexW2044146506MaRDI QIDQ834935

M. Ziaur Rahman, Md. Abul Kashem

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.07.007

zbMATH Keywords

parallel algorithmsordered coloringseparator-treetree contractionvertex-ranking

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Vertex ranking of asteroidal triple-free graphs
• Optimal node ranking of trees
• On a graph partition problem with application to VLSI layout
• Algorithms for generalized vertex-rankings of partial k-trees
• Optimal node ranking of tree in linear time
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• The Role of Elimination Trees in Sparse Factorization
• Rankings of Graphs
• A simple parallel tree contraction algorithm
• Algorithms and Computation

This page was built for publication: An optimal parallel algorithm forc-vertex-ranking of trees