Abstract
The problem of enumerating all the s-t minimal cutsets separating two vertices s and t specified in a class of undirected planar graphs, called D-S (delta-star) reducible graphs, is presented. The problem is handled by a new enumeration approach based on graph reductions that preserve minimal cutsets such that a graph with complex structure is transformed into a single edge connecting s and t by recursive applications. Some classes of undirected planar graphs, such as series-parallel and wheel graphs, are identified to be D-S reducible. The approach is provided with a polynomial-time (measured in total number of vertices) enumeration algorithm which is illustrated with a numerical example. The efficiency is shown through some computational experience.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
