tex-projects/LaTeX-examples
2
0
Fork 0
mirror of https://github.com/MartinThoma/LaTeX-examples.git synced 2025-04-26 06:48:04 +02:00
Code Activity
LaTeX-examples/presentations/ICPC-Referat
History
Martin Thoma c30bbc6f32 Added ICPC-Referat
2013-11-05 19:52:56 +01:00
..
logos Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Material Added ICPC-Referat 2013-11-05 19:52:56 +01:00
.gitignore Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Artikulationspunkt.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Bridge.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Eulerkreisproblem.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
fragen.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
GraphColoring.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Graphentheorie-2.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Hamiltonkreisproblem.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Kreise.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
KruskalsAlgorithm.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Literatur.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
make.bat Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Makefile Added ICPC-Referat 2013-11-05 19:52:56 +01:00
MinimaleSpannbaume.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
PrimsAlgorithm.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Quellen.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
README.md Added ICPC-Referat 2013-11-05 19:52:56 +01:00
SCC-finden.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
SCC.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Zusammenhang.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Zweifachverbundener-Graph.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00

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] (http://icpc.ira.uka.de/public/praktikum)' - a hands-on training at the [KIT] (http://kit.edu)

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