Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
Computational Optimization and Applications
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
Information Processing Letters
Hi-index | 0.89 |