MIT6_042JS10_lec11_prob - Massachusetts Institute of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Massachusetts Institute of Technology 6.042J/18.062J, Spring ’10 : Mathematics for Computer Science March 1 Prof. Albert R. Meyer revised February 27, 2010, 1329 minutes In-Class Problems Week 5, Mon. Problem 1. If a and b are distinct nodes of a digraph, then a is said to cover b if there is an edge from a to b and every path from a to b traverses this edge. If a covers b , the edge from a to b is called a covering edge . (a) What are the covering edges in the following DAG? 12 6 1 8 2 4 10 5 7 11 9 3 (b) Let covering ( D ) be the subgraph of D consisting of only the covering edges. Suppose D is a finite DAG. Explain why covering ( D ) has the same positive path relation as D . Hint: Consider longest paths between a pair of vertices. (c) Show that if two DAG ’s have the same positive path relation, then they have the same set of covering edges. (d) Conclude that covering ( D ) is the unique DAG with the smallest number of edges among all digraphs with the same positive path relation as
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/27/2011 for the course CS 6.042J taught by Professor Prof.albertr.meyer during the Spring '11 term at MIT.

Page1 / 3

MIT6_042JS10_lec11_prob - Massachusetts Institute of...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online