This preview shows page 1. Sign up to view the full content.
Unformatted text preview: added to G Problem 4: Suppose you are given an undirected graph G , with edge weights that you may assume are all distinct. G has n vertices and m edges. A particular edge e of G is specified. Given an algorithm with running time O ( m + n ) to decide whether e is contained in a minimum weight spanning tree of G ....
View
Full
Document
This note was uploaded on 08/15/2008 for the course CSCI 570 taught by Professor Shamsian during the Spring '06 term at USC.
 Spring '06
 Shamsian
 Algorithms

Click to edit the document details