Deformable Polygon Representation And Near-Mincuts

BUILDING BRIDGES: BETWEEN MATHEMATICS AND COMPUTER SCIENCE(2008)

引用 14|浏览6
暂无评分
摘要
We derive a necessary and sufficient condition for a symmetric family of sets to have a geometric representation involving a convex polygon and some of its diagonals. We show that cuts of value less than 6/5 times the edge-connectivity of a graph admit such a representation, thereby extending the cactus representation of all mincuts.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要