Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformaticanetworking:ae:ae2012:start [16/05/2013 alle 09:07 (13 anni fa)] – [Lectures] Paolo Ferragina
+++ magistraleinformaticanetworking:ae:ae2012:start [29/01/2014 alle 10:32 (12 anni fa)] (versione attuale) – [Exam] Paolo Ferragina
@@ Linea 33: / Linea 33: @@
-^ Dates ^ Room ^
+^ Dates ^ Room ^ Testo ^
+| 4 June2013 | C1 | {{:magistraleinformaticanetworking:ae:ae2012:ae130604.docx|text}} |
+| 25 June 2013 | C1 | {{:magistraleinformaticanetworking:ae:ae2012:ae130625.docx|text}} |
+| 16 July 2013 | C1 | {{:magistraleinformaticanetworking:ae:ae2012:ae130716.docx|text}} |
+| 12 September 2013 | B | {{:magistraleinformaticanetworking:ae:ae2012:ae130912.docx|text}} |
+| 8 January 2014 | C | {{:magistraleinformaticanetworking:ae:ae2012:ae140108.doc|text}} |
+| 29 January 2014 | C | {{:magistraleinformaticanetworking:ae:ae2012:ae140129.doc|text}} |
 ====== Background======
@@ Linea 85: / Linea 90: @@
 | 15/05/2013 | Minimum Spanning Tree: properties, greedy approach, Kruskal algorithm in RAM and disk. | {{:magistraleinformaticanetworking:ae:ae2012:mst-clr.pdf|clr}} and {{:magistraleinformaticanetworking:ae:ae2012:mst-mehlhorn.pdf|mehlhorn}} |
 | 16/05/2013 | Minimum Spanning Tree: Prim, semi-external algorithm, Sybein's algorithm with proof. MST's applications: clustering and Hamiltonian cycle. | |
+| 21/05/2013 | Self-evaluation over the following {{:magistraleinformaticanetworking:ae:ae2012:self.docx|exercises}}. | |
+| 22/05/2013 | Steiner Tree problem: an approximation algorithm. Matching in dense/generic graphs. | part of a {{:magistraleinformaticanetworking:ae:ae2012:graphmatchings-manber.pdf|book}} |
+| 23/05/2013 | Q&A time. |  |