Sākums Izpētīt Palīdzība
Pierakstīties
radu
/
LaTeX-examples
Vērot 1
Pievienot zvaigznīti 0
Atdalīts 0
Faili Problēmas 0 Izmaiņu pieprasījumi 0 Vikivietne
Koks: 2de9065138
Atzari Tagi
LaTeX-examples
/
presentations
/
ICPC-Referat
Martin Thoma de1ad26035 Adjust Python code to follow PEP8 9 gadi atpakaļ
..
Material de1ad26035 Adjust Python code to follow PEP8 9 gadi atpakaļ
logos c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ
.gitignore c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ
Artikulationspunkt.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Bridge.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Eulerkreisproblem.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
GraphColoring.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Graphentheorie-2.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Hamiltonkreisproblem.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Kreise.tex c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ
KruskalsAlgorithm.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Literatur.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Makefile c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ
MinimaleSpannbaume.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
PrimsAlgorithm.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Quellen.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
README.md c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ
SCC-finden.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
SCC.tex c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ
Zusammenhang.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
Zweifachverbundener-Graph.tex 7740f0147f Remove trailing spaces 10 gadi atpakaļ
fragen.tex c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ
make.bat c30bbc6f32 Added ICPC-Referat 12 gadi atpakaļ

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