ta4_question

# ta4_question - COMP 271H Design and Analysis of Algorithms...

• Notes
• 1

This preview shows page 1. Sign up to view the full content.

COMP 271H Design and Analysis of Algorithms 2006 Fall Semester Tutorial 4 1. A bipartite graph is an undirected graph G = ( V, E ) whose vertices can be partitioned into two subsets such that there is no edge between any two vertices in the same subset. (In other words, G is bipartite if and only if there exist two sets V 1 and V 2 such that V 1 V 2 = V , V 1 V 2 =
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: E connect some vertex in V 1 with some vertex in V 2 .) (a) Prove that a bipartite graph has no cycle of odd length. (b) Design an algorithm based on breadth-ﬁrst search (BFS) to determine if an undi-rected graph G is bipartite. (c) Fully justify the correctness of your algorithm. 1...
View Full Document

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern