Fast exact algorithms via the Matrix Tree Theorem

V. Arvind, Srijan Chakraborty, Samir Datta +1

Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each othe…