Abstract
Consider an acyclic directed graph $G$ with sources $s_1, s_2, \ldots,s_n$ and sinks $r_1, r_2, \ldots, r_n$. For $i=1, 2, \ldots,n$, let $c_i$ denote the size of the minimum edge cut between $s_i$...
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 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.
