COURSE UNIT TITLE

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASISTANT PROFESSOR ZEYNEP NIHAN BERBERLER

Offered to

Computer Science
Ph.D. in Computer Science

Course Objective

To analyze networks based on various centrality measures defined in literature with applications to computer science. To give a knowledge of basic concepts of networks. To solvecomputer science problems and problems of different type of disciplines by using network centrality concepts. To design efficient polynomial time algorithms to find the centrality measures of networks by using graph theory concepts.

Learning Outcomes of the Course Unit

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Recomended or Required Reading

L.C. Freeman, Centrality in social networks: conceptual clarification, Social Networks, (1979).
West D.B., Introduction to Graph Theory, Prentice Hall, NJ (2001).
V. Latora, M. Marchiori, Efficient behavior of small-world networks, Phys. Rev. Lett., (2001).

Planned Learning Activities and Teaching Methods

The course is given by the lecturer generally, some periods of the course will continue interactively.

Assessment Methods

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

zeynep.berberler@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Contribution of Learning Outcomes to Programme Outcomes