Wednesday, October 10, 2018 — 1:30 PM EDT
Anna Lubiw
David R. Cheriton School of Computer Science
In this talk I will look at geometric graph representations from the perspective of three issues: the algorithmic complexity of finding a representation; the bit complexity of the representation; and whether there is a morph between any two combinatorially equivalent representations.