Tractable feedback vertex sets in restricted bipartite graphs
COCOA（2011）
摘要
A feedback vertex set (FVS) is a subset of vertices whose removal renders the remaining graph a forest. We show that finding the minimum FVS is tractable in the so-called triad convex bipartite graphs.
更多查看译文
关键词
restricted bipartite graph,minimum fvs,so-called triad convex bipartite,remaining graph,tractable feedback vertex set,feedback vertex set
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要