Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs

DOI10.1109/24.126672zbMath0749.90085OpenAlexW2161391660MaRDI QIDQ4004839

B. K. Yoo, Chang Sup Sung

Publication date: 27 September 1992

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/24.126672

zbMATH Keywords

series-parallel graphminimal cutsetsundirected planar graphsdelta-to-star reductionpolynomial-time enumeration algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs