# hw3(2) - CS 373 Combinatorial Algorithms Spring 2001...

This preview shows pages 1–3. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CS 373 Homework 3 (due 3/8/2001) Spring 2001 2. Reliable Network: Suppose you are given a graph of a computer network G = ( V,E ) and a function r ( u,v ) that gives a reliability value for every edge ( u,v ) E such that 0 r ( u,v ) 1. The reliability value gives the probability that the network connection corresponding to that edge will not fail. Describe and analyze an algorithm to Fnd the most reliable path from a given source
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/15/2009 for the course 942 cs taught by Professor A during the Spring '09 term at University of Illinois at Urbana–Champaign.

### Page1 / 4

hw3(2) - CS 373 Combinatorial Algorithms Spring 2001...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online