Tez

Browse

Now showing 1 - 2 of 2

Counting and listing a special class of directed graphs
(Bahçeşehir Üniversitesi Fen Bilimleri Enstitüsü, 2013-08) Gönen, Mehmet Emin; Kaygun, Atabey
In this thesis, we count and list a special class of directed graphs. We consider directed graphs which are transitively reduced and do not contain cycles. These directed graphs have also unique sources and unique sinks. In the text, we called such directed graphs as “admissible digraphs”. Such directed graphs find applications in bioinformatics and network flow theory. We constructed explicit algorithms to count and list admissible digraphs with a specific number of vertices. Our counting algorithm is not exact, it gives us an upper bound on the number of admissible digraphs with a certain number of vertices. On the other hand, our listing algorithm is exact and list all admissible digraphs of certain vertex set size.
Solving university course timetabling problem using generic algorithm
(Institute of Science, 2008) Aydın, M. Aslı