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

Andreas Björklund Thore Husfeldt

Published in: ISAAC (2018)

Keyphrases

planar graphs
computational complexity
dynamic programming
objective function
probabilistic model
worst case
closed form
disjoint paths
optimal solution
xml documents
probability distribution
expectation maximization
convex hull