Two weeks after CanaDAM, UVic hosted the International Workshop on Combinatorial Algorithms. I presented a paper by me, Jing Huang, and Xuding Zhu which gives the first results of what would become my master’s thesis. It studies the computational complexity of the following problem: in a given graph, is there a matching which breaks all cycles of a given length?
Slides of the talk can be found here (PDF). I am grateful to NSERC for funding this research with a Alexander Graham Bell Canada Graduate Scholarship.
Complexity of cycle transverse matching problems. International Workshop on Combinatorial Algorithms. Ross Churchley, Jing Huang, and Xuding Zhu (2011). ↩︎