Abstract
The problem of finding a disconnected cut in a graph is NP‐hard in general but polynomial‐time solvable on planar graphs. The problem of finding a minimal disconnected cut is also NP‐hard but its computational complexity was not known for planar graphs. We show that it is polynomial‐time solvable on 3‐connected planar graphs but NP‐hard for 2‐connected planar graphs. Our technique for the first result is based on a structural characterization of minimal disconnected cuts in 3‐connected ‐free‐minor graphs and on solving a topological minor problem in the dual. In addition we show that the problem of finding a minimal connected cut of size at least 3 is NP‐hard for 2‐connected apex graphs. Finally, we relax the notion of minimality and prove that the problem of finding a so‐called semi‐minimal disconnected cut is still polynomial‐time solvable on planar graphs. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(4), 250–259 2016
Sign-in/Register to access full text options 
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.
