当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Maximum reachability preserved graph cut
Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-08-27 , DOI: 10.1016/j.tcs.2020.08.016
Dongjing Miao; Jianzhong Li; Zhipeng Cai

A class of reachability reduction problems were raised in the area of computer network security and software engineering. This paper studies such a reachability reduction problem on a vertex labeled graph. The reachability reduction here is modeled as maximum reachability preserved cut which is a variant of minimum multiway cut with a new objective function. Finding a maximum reachability preserved cut is to disconnect some labels specified in advance by edge deletion while preserving other reachable labels. It gives a way to model a large family of network problems based on graph model. We provide a comprehensive complexity analysis of this problem under different input settings. A landscape of the hardness hierarchy of this problem is shown in this paper, in which polynomial tractable and intractable cases are identified.

更新日期:2020-09-15

 

全部期刊列表>>
物理学研究前沿热点精选期刊推荐
科研绘图
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
自然职场线上招聘会
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
张晓晨
田蕾蕾
李闯创
刘天飞
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
X-MOL
清华大学
廖矿标
陈永胜
试剂库存
down
wechat
bug