Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Hardness of Approximating Independent Domination in Circle Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
Computational Optimization and Applications
Efficient algorithms for the minimum connected domination on trapezoid graphs
Information Sciences: an International Journal
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
Information Processing Letters
Efficient algorithm for the vertex connectivity of trapezoid graphs
Information Processing Letters
Hi-index | 0.89 |