A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width.

Lars Jaffke O-joung Kwon Jan Arne Telle

Published in: STACS (2018)

Keyphrases

worst case
vertex set
computational complexity
dynamic programming
learning algorithm
undirected graph
optimal solution
np hard
probabilistic model
graph structure
objective function
tree structure
weighted graph
directed graph
k means
approximation ratio
search engine