This preview shows page 1. Sign up to view the full content.
CSE 331: Introduction to Algorithm Analysis and Design
Fall 2011
Homework 8
Due Friday, November 11, 2011 by 1:15pm in class
Please submit each problem separately, i.e. each problem should begin on a new page and only the
pages for one problem should be stapled together. Failure to do so might result in some problem(s)
not being graded.
For general homework policies and our suggestions, please see the policy document.
In particular,
make sure you follow the collaboration policy properly.
Do not turn in Q 3 and Q4.
1. (40
points
) Design an
O
(
m
log
n
) time algorithm that given an undirected graph
G
= (
V,E
)
and edge weights
c
e
>
0 for every
e
∈
E
, outputs the
maximum
spanning tree: i.e. among
all the spanning trees for
G
, the algorithm outputs the one with the maximum total weight
of edges (breaking ties arbitrarily).
2. (45 + 15 = 60
points
) In class we have seem algorithms that compute the MST in time
O
(
m
log
n
). This is under the assumption that the graph is given it its adjacency list repre
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.
 Fall '11
 RUDRA

Click to edit the document details