QQ客服 官方微博 反馈留言

	Two hardness results on feedback vertex sets
	Jiang, Wei ; Liu, Tian ; Ren, Tienan ; Xu, Ke
	2011
英文摘要	A feedback vertex set is a subset of vertices whose deletion makes the remaining graph a forest. We show that the minimum FVS (MFVS) in star convex bipartite graphs is NP-hard to find, and give a tighter lower bound on the size of MFVS in sparse random graphs, to provide further evidence on the hardness of random CSPs. ? 2011 Springer-Verlag.; EI; 0
语种	英语
DOI标识	10.1007/978-3-642-21204-8_26
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/328870]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Jiang, Wei,Liu, Tian,Ren, Tienan,et al. Two hardness results on feedback vertex sets. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。