wisconsin
Discussion 3: Bipartite Graph Detection with BFS

Discussion 3: Bipartite Graph Detection with BFS

Content locked

The catalog is public. Reading this content requires approved access.

Sign in to read
Discussion 3: Bipartite Graph Detection with BFS
Problem 1: Bipartite graph detection
(a) A small example
(b) Modify BFS
(c) Why is the algorithm correct?
Success returns a valid split
A conflict rules out every valid split
(d) Running time
(e) Bonus: A rule involving cycles