Login / Signup
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm.
Andreas Björklund
Thore Husfeldt
Published in:
CoRR (2018)
Keyphrases
</>
dynamic programming
worst case
computational complexity
planar graphs
optimal solution
np hard
linear programming
minimum spanning tree
objective function
em algorithm
monte carlo
bayesian framework
weighted graph
piecewise linear
greedy heuristic
randomized algorithm