Site-wide links

Computing & Information Sciences

Discovering new, innovative methods and research opportunities in solving complex present-day and future computing challenges.

Finding and counting minimum cuts in graphs can be useful in image processing and segmentation and in networking systems such as computer or road networks. Researchers have previously developed polynomial-time algorithms to count minimum cuts in planar graphs which utilize the relationship between maximum... READ MORE