Summary
Graphs, or networks, are a ubiquitous way of representing data. Paths in graphs can represent, for instance, transportation routes, chemical reaction pathways, or information movement through a digital or social network. To efficiently compute meaningful information about paths in graphs it is important to have efficient algorithms with strong theoretical foundations, i.e., proofs of correctness and efficiency. This project addresses the theoretical foundations of algorithmic problems regarding paths in graphs. This research should enhance future artificial intelligence research through provid
