Course details

Graph Algorithms

GAL Acad. year 2016/2017 Winter semester 5 credits

Current academic year

Guarantor

Meduna Alexandr, prof. RNDr., CSc. (DIFS)

Language of instruction

Czech, English

Completion

Examination (written)

Time span

Assessment points

  • 60 pts final exam (written part)
  • 15 pts mid-term test (written part)
  • 25 pts projects

Department

Department of Information Systems (UIFS)

Study literature

  • Text přednášek.
  • T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, McGraw-Hill, 2002.

Fundamental literature

  • T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, McGraw-Hill, 2002.
  • J. Demel, Grafy, SNTL Praha, 1988.
  • J. Demel, Grafy a jejich aplikace, Academia, 2002. (Více o knize)
  • R. Diestel, Graph Theory, Third Edition, Springer-Verlag, Heidelberg, 2000.
  • J.A. McHugh, Algorithmic Graph Theory, Prentice-Hall, 1990.
  • J.A. Bondy, U.S.R. Murty: Graph Theory, Graduate text in mathematics, Springer, 2008.
  • J.L. Gross, J. Yellen: Graph Theory and Its Applications, Second Edition, Chapman & Hall/CRC, 2005.
  • J.L. Gross, J. Yellen: Handbook of Graph Theory (Discrete Mathematics and Its Applications), CRC Press, 2003.

Course inclusion in study plans

Back to top