Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs
Hirotoshi Honma, Kento Nishimura, Yuto Tamori, Yoko Nakajima · Journal of Applied Mathematics and Physics · 2019
The vertex connectivity k(G) of a graph G is the minimum number of nodes whose deletion disconnects it. Graph connectivity is one of the most fundamental problems in graph theory. In this paper, we designed an O(n2) time algorithm to solve connectivity problem on circular trapezoid graphs.