Moore-Bellman-Ford-like algorithms. His talk will include an explanation of what this actually means and venture into various graph problems, e.g. graph partitioning.
View Document Edit History