Complexity and approximability of the k -way vertex cut-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Complexity and approximability of the k -way vertex cut

Published:2013-10-15 Issue:2 Volume:63 Page:170-178
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Berger André¹,Grigoriev Alexander¹,van der Zwaan Ruben¹

Affiliation:

1. Operations Research Group, Department of Quantitative Economics, School of Business and Economics; Maastricht University; The Netherlands

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21534/fullpdf

Reference34 articles.

1. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora;J Comput Sys Sci,1999

2. Approximation algorithms for np-complete problems on planar graphs;Baker;J ACM,1994

3. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J Comput,1996

4. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theor Comput Sci,1998

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Network disruption via continuous batch removal: The case of Sicilian Mafia;PLOS ONE;2024-08-21

2. Securing Network Resilience: Leveraging Node Centrality for Cyberattack Mitigation and Robustness Enhancement;Information Systems Frontiers;2024-03-01

3. A Critical Node-Centric Approach to Enhancing Network Security;Dynamics of Information Systems;2023-12-28

4. Dynamic weight-based connectivity recovery in wireless sensor and actor networks;The Journal of Supercomputing;2023-07-03

5. Dynamic Weight-Based Connectivity Recovery in Wireless Sensor and Actor Networks;2023-02-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3