{"id":194,"date":"2022-12-07T11:15:00","date_gmt":"2022-12-07T11:15:00","guid":{"rendered":"https:\/\/aud.ibr.cs.tu-bs.de\/?p=194"},"modified":"2022-12-14T08:34:58","modified_gmt":"2022-12-14T07:34:58","slug":"vorlesung-11","status":"publish","type":"post","link":"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-11\/","title":{"rendered":"Vorlesung 11"},"content":{"rendered":"\n<p>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<p><strong>Folien: <\/strong><a href=\"http:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2223\/aud\/skript\/VL11.pdf\">VL11.pdf<\/a><br><strong>Video:<\/strong> <a rel=\"noreferrer noopener\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/go\/vl11_yt\/\" target=\"_blank\">[YouTube]<\/a>, <a rel=\"noreferrer noopener\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/go\/vl11_video\/\" target=\"_blank\">[IBR]<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Weitere Links<\/h3>\n\n\n\n<p><a href=\"https:\/\/idea-instructions.com\/graph-scan\/\">Graphenscan, BFS, DFS im IDEA-Projekt<\/a><br><a href=\"http:\/\/de.wikipedia.org\/wiki\/Online-Algorithmus\">Wikipedia zu Online-Algorithmen<\/a><br><a href=\"http:\/\/de.wikipedia.org\/wiki\/Ski-Rental-Problem\">Ski Rental: ein besonders eing\u00e4ngiges Online-Problem<\/a><\/p>\n\n\n\n\n\n<h3 class=\"wp-block-heading\">Weiterf\u00fchrende Themen zu Graphenalgorithmen<\/h3>\n\n\n\n<ol>\n<li><a href=\"http:\/\/www-i1.informatik.rwth-aachen.de\/~algorithmus\/algo7.php\">Algorithmus der Woche aus dem Informatikjahr 2006: K\u00fcrzeste Wege<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www-i1.informatik.rwth-aachen.de\/~algorithmus\/algo21.php\">Algorithmus der Woche aus dem Informatikjahr 2006: Minimale zusammenh\u00e4ngende Netzwerke<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www-i1.informatik.rwth-aachen.de\/~algorithmus\/algo23.php\">Algorithmus der Woche aus dem Informatikjahr 2006: Maximale Fl\u00fcsse<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/de.wikipedia.org\/wiki\/Fl\u00fcsse_und_Schnitte_in_Netzwerken\">Wikipedia zu Fl\u00fcssen und Schnitten in Graphen<\/a><\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>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":{"_uag_custom_page_level_css":"","site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"","footnotes":""},"categories":[6,12,8],"tags":[],"uagb_featured_image_src":{"full":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/graph_scan.png",914,774,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/graph_scan.png",150,127,false],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/graph_scan.png",300,254,false],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/graph_scan.png",768,650,false],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/graph_scan.png",914,774,false],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/graph_scan.png",914,774,false],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/graph_scan.png",914,774,false]},"uagb_author_info":{"display_name":"Matthias Konitzny","author_link":"https:\/\/aud.ibr.cs.tu-bs.de\/author\/konitzny\/"},"uagb_comment_info":0,"uagb_excerpt":"In dieser Vorlesung schlie\u00dfen wir das Kapitel 3 ab und schauen noch einmal auf verschiedene Eigenschaften von Breiten- und Tiefensuche.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/194"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/comments?post=194"}],"version-history":[{"count":12,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/194\/revisions"}],"predecessor-version":[{"id":3453,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/194\/revisions\/3453"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/195"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=194"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=194"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=194"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}