Subject: Subject Sylbus: Graph Algorithms - 234246

Graph Algorithms - 234246
Will not be given the year
Credit
Points
3.0
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1     6

Determination of the grade according to progress during the semester and a final examination.


Prerequisites ( Algebra a 104167
and Discrete Mathematics 234144 )
 
Linked Courses Data Structures 1 234218
 
Overlapping Courses Int. to Data Structur and Algorithms 044268
Data Structures and Algorithms 094223
Data Structures and Algorithms 094224
Combinatorial Algorithms 104287
Combinatorial Algorithms 104291
Combinatorics for Cs 234141
Algorithms 1 234247


The Course Includes Topics of Graph Theory with Emphasis on Algorithmic Questions and Their Complexity. Typical Subjects: Euler Paths, Shortest-Path Algorithms, Trees, Minimum Trees, Directed Trees, Konig'S Infinity Lemma, Tree Enumeration, Depth-First Search and Finding the Nonseparable Components, Huffman'S Code, Network Flow (Max-Flow Min-Cut Theorem, Algorithms for Max-Flow, Networks with Bounds, Minimum Flow).


Created in 08/12/2022 Time 21:45:29