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
=
∅
, and all the edges in
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 undirected graph G is bipartite. (c) Fully justify the correctness of your algorithm. 1...
View
Full
Document
This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.
 Spring '10
 may
 English

Click to edit the document details