{"id":194,"date":"2020-12-02T13:15:00","date_gmt":"2020-12-02T12:15:00","guid":{"rendered":"https:\/\/aud.ibr.cs.tu-bs.de\/?p=194"},"modified":"2021-03-02T16:11:30","modified_gmt":"2021-03-02T15:11:30","slug":"vorlesung-11","status":"publish","type":"post","link":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/2020\/12\/02\/vorlesung-11\/","title":{"rendered":"Vorlesung 11"},"content":{"rendered":"\n

In dieser Vorlesung schlie\u00dfen wir das Kapitel 3 ab und schauen noch einmal auf verschiedene Eigenschaften von Breiten- und Tiefensuche.<\/p>\n\n\n\n

Folien: <\/strong>VL11.pdf<\/a>
Notizen:<\/strong> VL11_b.pdf<\/a>
Video:<\/strong> [YouTube]<\/a>, [IBR]<\/a><\/p>\n\n\n\n

Weitere Links<\/h3>\n\n\n\n

Graphenscan, BFS, DFS im IDEA-Projekt<\/a>
Wikipedia zu Online-Algorithmen<\/a>
Ski Rental: ein besonders eing\u00e4ngiges Online-Problem<\/a>
Liedtext<\/a>
Das Lied im Original<\/a>
Ein bisschen zu vollst\u00e4ndiger Induktion<\/a><\/p>\n\n\n\n

Weiterf\u00fchrende Themen zu Graphenalgorithmen<\/h3>\n\n\n\n
  1. Algorithmus der Woche aus dem Informatikjahr 2006: K\u00fcrzeste Wege<\/a><\/li>
  2. Algorithmus der Woche aus dem Informatikjahr 2006: Minimale zusammenh\u00e4ngende Netzwerke<\/a><\/li>
  3. Algorithmus der Woche aus dem Informatikjahr 2006: Maximale Fl\u00fcsse<\/a><\/li>
  4. Wikipedia zu Fl\u00fcssen und Schnitten in Graphen<\/a><\/li><\/ol>\n","protected":false},"excerpt":{"rendered":"

    In dieser Vorlesung schlie\u00dfen wir das Kapitel 3 ab und schauen noch einmal auf verschiedene Eigenschaften von Breiten- und Tiefensuche.<\/p>\n","protected":false},"author":1,"featured_media":195,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[6,12,8],"tags":[],"_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/194"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/comments?post=194"}],"version-history":[{"count":6,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/194\/revisions"}],"predecessor-version":[{"id":574,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/194\/revisions\/574"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media\/195"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media?parent=194"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/categories?post=194"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/tags?post=194"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}