Drawing Algorithms for Almost Planar Graphs

Summary

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

Supervisor(s)

Professor Seok-Hee Hong

Research Location

Information Technologies

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?

Contact us to find out what’s involved in applying for a PhD.

Contact Research Expert to find out more about participating in this opportunity.

Browse for other opportunities within the Information Technologies .

Keywords

graph algorithms, graph drawing, graph theory

Opportunity ID

The opportunity ID for this research opportunity is: 1012

Other opportunities with Professor Seok-Hee Hong