tex-projects/LaTeX-examples
2
0
Fork 0
mirror of https://github.com/MartinThoma/LaTeX-examples.git synced 2025-04-19 11:38:05 +02:00
Code Activity
LaTeX-examples/presentations/ICPC-Referat
History
Martin Thoma de1ad26035 Adjust Python code to follow PEP8
2015-11-20 23:12:22 +01:00
..
logos Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Material Adjust Python code to follow PEP8 2015-11-20 23:12:22 +01:00
.gitignore Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Artikulationspunkt.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Bridge.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Eulerkreisproblem.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
fragen.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
GraphColoring.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Graphentheorie-2.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Hamiltonkreisproblem.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Kreise.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
KruskalsAlgorithm.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Literatur.tex Remove trailing spaces 2015-10-14 14:25:34 +02: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 Remove trailing spaces 2015-10-14 14:25:34 +02:00
PrimsAlgorithm.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Quellen.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
README.md Added ICPC-Referat 2013-11-05 19:52:56 +01:00
SCC-finden.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
SCC.tex Added ICPC-Referat 2013-11-05 19:52:56 +01:00
Zusammenhang.tex Remove trailing spaces 2015-10-14 14:25:34 +02:00
Zweifachverbundener-Graph.tex Remove trailing spaces 2015-10-14 14:25:34 +02: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