Graph matching encompasses a class of computational problems aimed at identifying a correspondence between the vertex sets of two graphs so as to maximise structural similarity or alignment. Exact ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Text: : "Graph Theory" by J. Adrian Bondy and U.S.R. Murty; Graduate Texts in Mathematics 244, Springer 2008. ISBN 978-1-84628-969-9, 2nd printing, 978-1-84628-970-5 (ebook). Notes will be supplied ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.