An optimal parallel algorithm forc-vertex-ranking of trees
From MaRDI portal
Publication:834935
DOI10.1016/J.IPL.2004.07.007zbMATH Open1173.68846OpenAlexW2044146506MaRDI QIDQ834935FDOQ834935
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
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
- Optimal node ranking of trees
- Rankings of Graphs
- Title not available (Why is that?)
- On a graph partition problem with application to VLSI layout
- Optimal node ranking of tree in linear time
- Vertex ranking of asteroidal triple-free graphs
- The Role of Elimination Trees in Sparse Factorization
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Algorithms for generalized vertex-rankings of partial k-trees
- A simple parallel tree contraction algorithm
- Algorithms and Computation
Cited In (4)
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)
