1. Graph Coloring Problem
In this presentation, the graph of coloring problem, which has an important place in the graph theory, is discussed. Different coloring algorithms and their application areas were emphasized and optimization techniques and difficulties were discussed.
2. Use of symmetrical matrices in engineering fields
In this presentation, where we examine how symmetrical matrices are used in engineering fields, theoretical information is supported by practical examples.
3. Network science
In this presentation on network science, the basic concepts of network theory, social network analyzes, network dynamics and examination of network structures are discussed. In addition, the modeling and analysis of real world networks has been emphasized.
4. Rota optimization and discrete math
In this presentation, where we combine route optimization and discrete mathematics, route optimization techniques, algorithms and software used in transportation and logistics sectors were examined. It has been discussed how the basic areas of discrete mathematics are used in route optimization problems. The combination of these two disciplines offers practical solutions that provide productivity and cost advantages.
As the Computer Science Department, we will continue our work with the passion of learning and sharing the technologies of the future.
