An optimal parallel algorithm forc-vertex-ranking of trees

DOI10.1016/J.IPL.2004.07.007MaRDI QIDQ834935zbMATH OpenOpenAlexFDO

Authors Md. Abul Kashem, M. Ziaur Rahman

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)

Recommendations

• Algorithms and Computation
• An optimal parallel algorithm for node ranking of cographs
• A simple optimal parallel algorithm for a core of a tree
• An optimal parallel algorithm for computing furthest neighbors in a tree
• scientific article; zbMATH DE number 54593
• Parallel Processing and Applied Mathematics
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Parallel algorithms with optimal speedup for bounded treewidth
• Efficient parallel algorithms for some tree layout problems

Cites work

• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• A simple parallel tree contraction algorithm
• Algorithms and Computation
• Algorithms for generalized vertex-rankings of partial k-trees
• On a graph partition problem with application to VLSI layout
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• Optimal node ranking of tree in linear time
• Optimal node ranking of trees
• Rankings of Graphs
• The Role of Elimination Trees in Sparse Factorization
• Vertex ranking of asteroidal triple-free graphs

Cited in

(4)

• Algorithms for generalized vertex-rankings of partial k-trees
• On vertex ranking of a starlike graph
• Vertex ranking with capacity
• Algorithms and Computation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834935)