Startsida Utforska Hjälp
Logga in
radu
/
LaTeX-examples
Bevaka 1
Stjärnmärk 0
Fork 0
Filer Ärenden 0 Pull-förfrågningar 0 Wiki
Träd: cd71a3ee53
Grenar Taggar
LaTeX-examples
/
presentations
/
ICPC-Referat
Martin Thoma de1ad26035 Adjust Python code to follow PEP8 10 år sedan
..
Material de1ad26035 Adjust Python code to follow PEP8 10 år sedan
logos c30bbc6f32 Added ICPC-Referat 12 år sedan
.gitignore c30bbc6f32 Added ICPC-Referat 12 år sedan
Artikulationspunkt.tex 7740f0147f Remove trailing spaces 10 år sedan
Bridge.tex 7740f0147f Remove trailing spaces 10 år sedan
Eulerkreisproblem.tex 7740f0147f Remove trailing spaces 10 år sedan
GraphColoring.tex 7740f0147f Remove trailing spaces 10 år sedan
Graphentheorie-2.tex 7740f0147f Remove trailing spaces 10 år sedan
Hamiltonkreisproblem.tex 7740f0147f Remove trailing spaces 10 år sedan
Kreise.tex c30bbc6f32 Added ICPC-Referat 12 år sedan
KruskalsAlgorithm.tex 7740f0147f Remove trailing spaces 10 år sedan
Literatur.tex 7740f0147f Remove trailing spaces 10 år sedan
Makefile c30bbc6f32 Added ICPC-Referat 12 år sedan
MinimaleSpannbaume.tex 7740f0147f Remove trailing spaces 10 år sedan
PrimsAlgorithm.tex 7740f0147f Remove trailing spaces 10 år sedan
Quellen.tex 7740f0147f Remove trailing spaces 10 år sedan
README.md c30bbc6f32 Added ICPC-Referat 12 år sedan
SCC-finden.tex 7740f0147f Remove trailing spaces 10 år sedan
SCC.tex c30bbc6f32 Added ICPC-Referat 12 år sedan
Zusammenhang.tex 7740f0147f Remove trailing spaces 10 år sedan
Zweifachverbundener-Graph.tex 7740f0147f Remove trailing spaces 10 år sedan
fragen.tex c30bbc6f32 Added ICPC-Referat 12 år sedan
make.bat c30bbc6f32 Added ICPC-Referat 12 år sedan

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