[[courses:cs211:winter2014:journals:emily:entryfour]]
Trace: • chapter4 • chapter4 • entrythree • chapterfour_sectioni • entrytwo • chapterthreesectionvi • chapter2 • entryfive • chapter1 • chapter4
Show page
AdminRecent ChangesSitemap

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
courses:cs211:winter2014:journals:emily:entryfour [2014/02/11 03:23] – [Chapter 3.6] hardyecourses:cs211:winter2014:journals:emily:entryfour [2014/02/11 03:24] (current) – [Chapter 3.4] hardye
Line 31: Line 31:
  
 Consider case 2 where G must contain an odd cycle so there is an edge that connects two nodes in the same layer. Supposed the two nodes in the same layer, x and y, are in layer L<sub>j</sub>. Let z be the node that is in layer L<sub>i</sub>, the lowest common ancestor, the node that is directly above x and y, and L<sub>i</sub> > L<sub>j</sub>. There is a cycle in the path z-x and y-z. The length of the cycle is 2(j-i)+1 which is an odd number.  Consider case 2 where G must contain an odd cycle so there is an edge that connects two nodes in the same layer. Supposed the two nodes in the same layer, x and y, are in layer L<sub>j</sub>. Let z be the node that is in layer L<sub>i</sub>, the lowest common ancestor, the node that is directly above x and y, and L<sub>i</sub> > L<sub>j</sub>. There is a cycle in the path z-x and y-z. The length of the cycle is 2(j-i)+1 which is an odd number. 
 +
 +Readability: 10. Very easy reading, kind of dry.
  
 ====== Chapter 3.5 ====== ====== Chapter 3.5 ======
courses/cs211/winter2014/journals/emily/entryfour.1392089024.txt.gz · Last modified: 2014/02/11 03:23 by hardye
Show pageOld revisions
Media ManagerBack to top
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0