Abstract

We consider a planar graph G in which the edges have nonnegative integer lengths such that the length of every cycle of G is even, and three faces are distinguished, called holes in G. It is known that there exists a packing of cuts and (2,3)-metrics with nonnegative integer weights in G which realizes the distances within each hole. We develop a purely combinatorial strongly polynomial-time algorithm to find such a packing.

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.