Abstract
This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals or complements. We study several optimization problems, which differ in their arc-connectivity requirements defined by the set of sources, the set of targets and the arc-connectivity value.
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
