Abstract

The subject is the 3-edge-connectivity augmentation problem. Given an undirected multi-graph G/sub 0/=(V, E), find an edge set E' of minimum cardinality such that the graph (V, E union E') is 3-edge-connected, where each edge of E' connects vertices of V. The authors propose an O( mod V mod + mod E mod ) augmenting algorithm for the problem. It finds a solution to the 3-edge-connectivity augmentation problem if all k-components (k >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.