Shortest $$(A+B)$$(A+B)-Path Packing Via Hafnian
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0334-0
Abstract: Björklund and Husfeldt developed a randomized polynomial time algorithm to solve the shortest two disjoint paths problem. Their algorithm is based on computation of permanents modulo 4 and the isolation lemma. In this paper, we… read more here.
Keywords: disjoint paths; two disjoint; path packing; path ... See more keywords