Certifying algorithms Algorithms and Networks. Certifying algorithms What is it? Examples: –Euler tour –Bipartite graphs –Flow –Planarity Certifying algorithms2.
Beyond the flow decomposition barrier Authors: A. V. Goldberg and Satish Rao (1997) Presented by Yana Branzburg Advanced Algorithms Seminar Instructed.
Beyond the flow decomposition barrier
Administrative stuff Office hours: After class on Tuesday.
