Drawing Algorithms for Almost Planar Graphs

Summary

More about Professor Seok-Hee Hong Stay in touch

The project aims to develop graph drawing algorithms under a number of constraints related to planarity.

Supervisor

Professor Seok-Hee Hong.

Research location

Computer Science

Program type

Masters/PHD

Synopsis

Graph drawing algorithms aim to produce human-readable pictures of relational data. These algorithms are used in visualization software underlying many data mining tools, in domains such as market surveillance, fraud detection, bioinformatics, software re-engineering, and counter-terrorism. Planar graph drawing algorithms have a long history both in the theoretical mathematical literature and the pragmatic visualization literature; however, the planarity constraint is very restrictive for practical applications, and this project aims to relax this constraint.

Want to find out more?

Interested in this opportunity? Want to know what to do next? Find out all you need to know about the application process including how to approach a potential supervisor via email and how to develop a research proposal.
Browse for other opportunities within the Computer Science.
Contact us to find out what's involved in applying for a PhD. Domestic students and international students.

Opportunity ID

The opportunity ID for this research opportunity is 1012