Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width.
Lars JaffkeO-joung KwonJan Arne TellePublished in: IPEC (2017)
Keyphrases
- polynomial time complexity
- disjoint paths
- worst case
- optimization problems
- np complete
- graph theory
- computational complexity
- bounded treewidth
- computational problems
- benchmark problems
- shortest path
- edge weights
- directed graph
- data structure
- partial solutions
- approximation algorithms
- combinatorial optimization
- decision problems
- special case
- bayesian networks
- random walk
- upper bound
- run times
- minimum cost flow
- evolutionary algorithm
- finding the shortest path