Trapezoid graphs and their coloring
Discrete Applied Mathematics
Journal of Graph Theory
On the 2-chain subgraph cover and related problems
Journal of Algorithms
Dominations in trapezoid graphs
Information Processing Letters
Steiner set and connected domination in trapezoid graphs
Information Processing Letters
On the structure of trapezoid graphs
Discrete Applied Mathematics
Trapezoid graphs and generalizations, geometry and algorithms
Discrete Applied Mathematics
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs
Computational Optimization and Applications
Introduction to algorithms
Efficient algorithms for the minimum connected domination on trapezoid graphs
Information Sciences: an International Journal
An efficient algorithm to solve connectivity problem on trapezoid graphs
Journal of Applied Mathematics and Computing
Counting the number of vertex covers in a trapezoid graph
Information Processing Letters
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
Information Processing Letters
| Hi-index | 0.89 |
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing problems in VLSI design and identifying the optimal chain of non-overlapping fragments in bioinformatics. Using modified binary indexed tree data structure, we design an algorithm for calculating the vertex connectivity of trapezoid graph G with time complexity O(nlogn), where n is the number of trapezoids.