Abstract
AbstractWe discuss an efficient primal‐dual algorithm for finding a minimum cost edge cover in an undirected network G with n nodes and m edges, which is based on the blossom algorithm for 1‐matching problems. We establish that its worst case computational complexity is O(n3), the same as that for blossom or primal algorithms for 1‐matching problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
