IE 515 Çizgeler ve Serimlerde Akış
Kredi Bilgisi:
(3+0+0) 3
Açıklama:
Introduction to graph theory; graph search; data structures for graph and network flow algorithms; shortest path problems; minimum spanning tree problem; matching in bipartite graphs; maximum flow - minimum cut and minimum cost circulation problems.
Dersi veren öğretim görevlileri:
Syllabus:
