Abstract
This paper presents a deterministic O (nm log n + n2log2n) = O (nm) time algorithm for splitting off all edges incident to a vertex s of even degree in a multigraph G, where n and m are the numbers of vertices and links (= vertex pairs between which G has an edge) in G, respectively. Based on this, many graph algorithms using edge-splitting can run faster. For example, the edge-connectivity augmentation problem in an undirected multigraph can be solved in O (nm) time, which is an improvement over the previously known randomized O (n3) bound and deterministic O (n2m) bound.
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 callDisclaimer: 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.
