Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width.

Benjamin Bergougnoux Charis Papadopoulos Jan Arne Telle

Published in: Algorithmica (2022)

Keyphrases

vertex set
undirected graph
weighted graph
random graphs
directed graph
graph structure
approximation algorithms
minimum cost
spanning tree
relevance feedback
complex networks
connected components
directed acyclic graph
maximum distance
np hard
edge weights
tree structure
random walk
probabilistic model