Efficient parallel algorithms
Trapezoid graphs and their coloring
Discrete Applied Mathematics
A linear time algorithm for finding all hinge vertices of a permutation graph
Information Processing Letters
Finding the set of all hinge vertices for strongly chordal graphs in linear time
Information Sciences: an International Journal
A parallel algorithm for solving the coloring problem on trapezoid graphs
Information Processing Letters
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
| Hi-index | 0.00 |
Let G = (V, E) be an undirected simple graph with u ε V. If there exist any two vertices in G whose distance becomes longer when a vertex u is removed, then u is defined as a hinge vertex. Finding the set of hinge vertices in a graph is useful for identifying critical nodes in an actual network. A number of studies concerning hinge vertices have been made in recent years. In a number of graph problems, it is known that more efficient sequential or parallel algorithms can be developed by restricting classes of graphs. In this paper, we shall propose a parallel algorithm which runs in O(log n) time with O(n/log n) processors on EREW PRAM for finding all hinge vertices of a circular-arc graph.