eduzhai > Physical Sciences > Physics Sciences >

Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs

  • Save

... pages left unread,continue reading

Document pages: 8 pages

Abstract: 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.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×