The vertex k-cut problem-Reference-Cited by-同舟云学术

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

The vertex k-cut problem

Published:2019-02 Issue: Volume:31 Page:8-28
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Cornaz Denis,Furini Fabio^ORCID,Lacroix Mathieu,Malaguti Enrico,Mahjoub A. Ridha,Martin Sébastien

Funder

Gaspard Monge Program for Optimization and operations research

MIUR

Nonlinear and combinatorial aspects of complex networks

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference29 articles.

1. Complexity and approximability of the k-way vertex cut;Berger;Networks,2014

2. On the minimum cut separator problem;Ben-Ameur;Networks,2012

3. Parameterized graph separation problems;Marx;Theoret. Comput. Sci.,2006

4. The k-separator problem;Ben-Ameur,2013

5. Np-completeness of the planar separator problems;Fukuyama;J. Graph Algorithms Appl.,2006

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

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

2. A Graph Multi-separator Problem for Image Segmentation;Journal of Mathematical Imaging and Vision;2024-08-12

3. A Flexible Divisive Algorithm for Overlapping Community Detection Based on Community Structure;2024

4. Distributed Data Management;Distributed Systems;2023-02-10

5. Detecting $k$-Vertex Cuts in Sparse Networks via a Fast Local Search Approach;IEEE Transactions on Computational Social Systems;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP