Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

Andreas Björklund, Thore Husfeldt. Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. In Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao, editors, 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. Volume 123 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.