Strona główna Odkrywaj Pomoc
Zaloguj się
radu
/
LaTeX-examples
Obserwuj 1
Polub 0
Forkuj 0
Pliki Problemy 0 Oczekujące zmiany 0 Wiki
Drzewo: b51af12225
Gałęzie Tagi
LaTeX-examples
/
presentations
/
ICPC-Referat
Martin Thoma de1ad26035 Adjust Python code to follow PEP8 10 lat temu
..
Material de1ad26035 Adjust Python code to follow PEP8 10 lat temu
logos c30bbc6f32 Added ICPC-Referat 12 lat temu
.gitignore c30bbc6f32 Added ICPC-Referat 12 lat temu
Artikulationspunkt.tex 7740f0147f Remove trailing spaces 10 lat temu
Bridge.tex 7740f0147f Remove trailing spaces 10 lat temu
Eulerkreisproblem.tex 7740f0147f Remove trailing spaces 10 lat temu
GraphColoring.tex 7740f0147f Remove trailing spaces 10 lat temu
Graphentheorie-2.tex 7740f0147f Remove trailing spaces 10 lat temu
Hamiltonkreisproblem.tex 7740f0147f Remove trailing spaces 10 lat temu
Kreise.tex c30bbc6f32 Added ICPC-Referat 12 lat temu
KruskalsAlgorithm.tex 7740f0147f Remove trailing spaces 10 lat temu
Literatur.tex 7740f0147f Remove trailing spaces 10 lat temu
Makefile c30bbc6f32 Added ICPC-Referat 12 lat temu
MinimaleSpannbaume.tex 7740f0147f Remove trailing spaces 10 lat temu
PrimsAlgorithm.tex 7740f0147f Remove trailing spaces 10 lat temu
Quellen.tex 7740f0147f Remove trailing spaces 10 lat temu
README.md c30bbc6f32 Added ICPC-Referat 12 lat temu
SCC-finden.tex 7740f0147f Remove trailing spaces 10 lat temu
SCC.tex c30bbc6f32 Added ICPC-Referat 12 lat temu
Zusammenhang.tex 7740f0147f Remove trailing spaces 10 lat temu
Zweifachverbundener-Graph.tex 7740f0147f Remove trailing spaces 10 lat temu
fragen.tex c30bbc6f32 Added ICPC-Referat 12 lat temu
make.bat c30bbc6f32 Added ICPC-Referat 12 lat temu

README.md

Graphalgorithms II

This are the slides for our short presentation about algorithms that operate on graphs. This presentation is in context of 'ICPC' - a hands-on training at the KIT

Work-sharing

  • Tobi: Minimal spanning trees
  • Martin: SCC (general introduction, how to find scc)
  • Max: SCC (biconnected graphs, articulation points, bridges), Coloring
  • Thomas: hamiltonian and eulerian circles

Deadlines

  • 15.05.2012: draft of the talk
  • 24.05.2012: release of the final presentation
  • 31.05.2012: the presentation

Compiling this document

  • You have to run make twice to compile it
  • If you want the KIT-Style, you should take a look at this Readme