User:Pessoazinho/sandbox

Graph Theory (Math 634) Spring 2014 Project

As a part of the requirement of Math 634: Graph Theory, I will be editing two Wikipedia entries. One will be a biography of a graph theorist, and the other will be a page on a mathematical result whose production (s)he was integral to. The person I chose is Derek Gordon Corneil, a famous mathematician and computer scientist.

The scope of my project

I will focus on two main aspects of Dr. Corneil's existence:

1. Derek Corneil


 * His life (and education)

Here I want to give a general overview of his life with a focus on his studies at the tertiary level, but also with respect to experiences that shaped him as a mathematician and computer scientist.


 * His work

Here I will add to his contributions already listed in the original article, and add a blurb to a select few - including the one I will be saying ore about in the other Wiki article. Some of these are:

Asteroidal Triple-Free Graphs

Complexity of Finding Embeddings in a k-Tree

Tree Spanners

Complement reducible graphs

The aim is also to include the applications of of his findings. Here are some of the references I'll use for this part of the project.

i) http://blogs.technet.com/b/cdnitmanagers/archive/2011/06/13/derek-corneil-renowned-and-esteemed-computer-science-professor-emeritus-university-of-toronto.aspx

ii)http://www.informatik.uni-trier.de/~ley/pers/hd/c/Corneil:Derek_G=.html

iii) http://www.sciencedirect.com/science/article/pii/0166218X81900135#

iv) http://www.cs.toronto.edu/dcs/people-faculty-dgc.html

2. Dr. Corneil's work

The work I want to expand on is Dr. Corneil's contribution to the knowledge of tree spanners. In his paper on the topic co-written with Leizhen Cai, Dr. Corneil studies the "graph theoretic, algorithmic, and complexity issues" related to tree spanners.

Here is the paper I'll be referencing:

i) http://epubs.siam.org/doi/abs/10.1137/S0895480192237403