My current research interest is in the area of Graph Algorithms. The objective is to design efficient graph algorithms on different types of computer models, such as the sequential RAM, PRAMS (Parallel RAMs), asynchronous distributed model, self-stabilizing model, External-Memory model. My current focus is on graph connectivity and related problems. Graph connectivity is one of the most basic properties of graph. Owing to this reason, it is fundamental to the studies of many important applications such as network reliability, circuit and chip design, network flow, cluster analysis, graph optimization, quatum physics and bioinformatics. This research is supported by an NSERC individual discovery grant.
I have openings for graduate students (M.Sc. and Ph.D. level). Potential applicants who do not have a computer science degree but have a math degree and have taken a few computer science courses including the Data Structures course are encouraged to apply. They may contact me first by sending me a copy of their vita and an official transcript through e-mail via peter@uwindsor.ca.