Joseph Sawada, University of Guelph
Associate Director, Graduate Studies
Professor
Guelph, Ontario
jsawada@uoguelph.ca
Office:
(519) 824-4120 ext. 53277
Bio/Research
The goal of Dr. Sawada's research is to gain a more thorough understanding of the object in question by considering how to efficiently list all non-isomorphic instances of that object. A variety of combinatorial objects from necklaces to free plane trees to stamp foldings to vertex orderings of c...
Click to Expand >>
Click to Expand >>
Bio/Research
The goal of Dr. Sawada's research is to gain a more thorough understanding of the object in question by considering how to efficiently list all non-isomorphic instances of that object. A variety of combinatorial objects from necklaces to free plane trees to stamp foldings to vertex orderings of chordal graphs are investigated. No interesting object is left behind.
Another interesting question that arises, is whether or not each instance can be listed so that there is a constant amount of change between successive objects. Such algorithms are called Gray codes.
Delving into graphs also involves careful study of the structure of the specific class of graphs under investigation. Complexity results are of interest as well as recognition algorithms and forbidden sub-structure characterizations.
Click to Shrink <<
Another interesting question that arises, is whether or not each instance can be listed so that there is a constant amount of change between successive objects. Such algorithms are called Gray codes.
Delving into graphs also involves careful study of the structure of the specific class of graphs under investigation. Complexity results are of interest as well as recognition algorithms and forbidden sub-structure characterizations.
Click to Shrink <<