An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Finding the set of all hinge vertices for strongly chordal graphs in linear time
Information Sciences: an International Journal
Hi-index | 0.89 |