Weekly Notes for Week 25

I will present an algorithm to find the k shortest hyperpaths in a hypergraph and show how this relates to finding good synthesis plans.

• Recommended Reading:

  – Finding the K best synthesis plans, Rolf Fagerberg, Christoph Flamm, Rojin Kianian, Daniel Merkle & Peter F. Stadler, Journal of Cheminformatics volume 10, Article number: 19 (2018)