Skip to main content
WueCampus
  • Nützliche Links
    Veranstaltungssuche
    Rechenzentrum
    Website-Support
    Häufige Fragen
    Lehre Digital
    Forschung Digital
    Lecture - Videoupload
    CaseTrain
  • More
English ‎(en)‎
Català ‎(ca)‎ Deutsch ‎(de)‎ Deutsch (du) ‎(de_du)‎ English ‎(en)‎ Español - Internacional ‎(es)‎ Français ‎(fr)‎ Italiano ‎(it)‎ Português - Portugal ‎(pt)‎ Svenska ‎(sv)‎ Türkçe ‎(tr)‎ Русский ‎(ru)‎ العربية ‎(ar)‎
You are currently using guest access
Log in
WueCampus
Nützliche Links Collapse Expand
Veranstaltungssuche Rechenzentrum Website-Support Häufige Fragen Lehre Digital Forschung Digital Lecture - Videoupload CaseTrain
Expand all Collapse all
  1. Home
  2. SS20_EXA
  3. Zusätzliche Materialien
  4. Lecture 11: Channel Assignment, NP-completeness on bounded treewidth graphs

Lecture 11: Channel Assignment, NP-completeness on bounded treewidth graphs

Completion requirements
Click on Lecture 11: Channel Assignment, NP-completeness on bounded treewidth graphs to open the resource.
◄ Lecture 9: source paper -- W[1]-completeness of Indep. Set
Exercise Sheet 13: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization ►

Impressum | Datenschutzerklärung - WueCampus |  Erklärung zur Barrierefreiheit |  Bildnachweise

Navigationsleiste - WueStudy: University icons created by justicon - Flaticon
Navigationsleiste - Rechenzentrum: Data center icons created by Eucalyp - Flaticon
Navigationsleiste - Website Support: Consultant icons created by Vitaly Gorbachev - Flaticon
Navigationsleiste - Häufige Fragen: Files and folders icons created by Freepik - Flaticon
Navigationsleiste - Lehre Digital: Training icons created by vectorspoint - Flaticon
Navigationsleiste - Forschung Digital: Research icons created by Eucalyp - Flaticon
Navigationsleiste - Lecture: Video icons created by Freepik - Flaticon
Werbefeld 2 - WueLogin: Login icons created by Freepik - Flaticon
Werbefeld 3 - Upgrade WueCampus 4.4: Update icons created by Freepik - Flaticon