Abstract
The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes O(K(G)mn1.5) time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes O(n2) time and O(n) space for a trapezoid graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.