Inicio Explorar Axuda
Iniciar sesión
radu
/
LaTeX-examples
Seguir 1
Destacar 0
Fork 0
Ficheiros Incidencias 0 Pull Requests 0 Wiki
Árbore: cd71a3ee53
Ramas Etiquetas
LaTeX-examples
/
presentations
/
ICPC-Referat
Martin Thoma de1ad26035 Adjust Python code to follow PEP8 %!s(int64=10) %!d(string=hai) anos
..
Material de1ad26035 Adjust Python code to follow PEP8 %!s(int64=10) %!d(string=hai) anos
logos c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos
.gitignore c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos
Artikulationspunkt.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Bridge.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Eulerkreisproblem.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
GraphColoring.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Graphentheorie-2.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Hamiltonkreisproblem.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Kreise.tex c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos
KruskalsAlgorithm.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Literatur.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Makefile c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos
MinimaleSpannbaume.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
PrimsAlgorithm.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Quellen.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
README.md c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos
SCC-finden.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
SCC.tex c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos
Zusammenhang.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
Zweifachverbundener-Graph.tex 7740f0147f Remove trailing spaces %!s(int64=10) %!d(string=hai) anos
fragen.tex c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos
make.bat c30bbc6f32 Added ICPC-Referat %!s(int64=12) %!d(string=hai) anos

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