In dieser Vorlesung wird der Graphenscanalgorithmus vorgestellt um Zusammenhangskomponenten in Graphen zu finden.<\/p>\n\n\n\n
Folien: <\/strong>VL6.pdf<\/a> Wikipedia-Seite: Zusammenhang von Graphen<\/a> In dieser Vorlesung wird der Graphenscanalgorithmus vorgestellt um Zusammenhangskomponenten in Graphen zu finden.<\/p>\n","protected":false},"author":1,"featured_media":182,"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":[12,15],"tags":[],"uagb_featured_image_src":{"full":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/ZusammenhaengenderGraphMitKantenzug.png",219,189,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/ZusammenhaengenderGraphMitKantenzug.png",150,129,false],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/ZusammenhaengenderGraphMitKantenzug.png",219,189,false],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/ZusammenhaengenderGraphMitKantenzug.png",219,189,false],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/ZusammenhaengenderGraphMitKantenzug.png",219,189,false],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/ZusammenhaengenderGraphMitKantenzug.png",219,189,false],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/ZusammenhaengenderGraphMitKantenzug.png",219,189,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 wird der Graphenscanalgorithmus vorgestellt um Zusammenhangskomponenten in Graphen zu finden.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/181"}],"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=181"}],"version-history":[{"count":8,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/181\/revisions"}],"predecessor-version":[{"id":3439,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/181\/revisions\/3439"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/182"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=181"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=181"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=181"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Notizen:<\/strong> Definitionen [PDF]<\/a>
Video:<\/strong> [YouTube]<\/a>, [IBR]<\/a><\/p>\n\n\n\nWeitere Links<\/h3>\n\n\n\n
Wikipedia-Seite: Aufspannende B\u00e4ume<\/a>
Das Problem aus “Good Will Hunting: B\u00e4ume z\u00e4hlen<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"