Graph fragmentation problem: analysis and synthesis

Author:

Aprile Manuel1,Castro Natalia2,Ferreira Graciela2,Piccini Juan2,Robledo Franco2,Romero Pablo2

Affiliation:

1. DISOPT; École Polytechnique Fédérale de Lausanne; Station 8 CH-1015 Lausanne Switzerland

2. Laboratorio de Probabilidad y Estadística, Facultad de Ingeniería; Universidad de la República; Julio Herrera y Reissig 565 PC 11300 Montevideo Uruguay

Funder

Project 395 CSIC I+D Sistemas Binarios Estocásticos Dinámicos

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

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

1. A tight approximation algorithm for the cluster vertex deletion problem;Mathematical Programming;2022-01-07

2. A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem;Integer Programming and Combinatorial Optimization;2021

3. Metaheuristic Techniques in Attack and Defense Strategies for Cybersecurity: A Systematic Review;Artificial Intelligence for Cyber Security: Methods, Issues and Possible Horizons or Opportunities;2021

4. An Interplay between Critical Node Detection and Epidemic Models;2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM);2019-10

5. Challenges in Stochastic Binary Systems;2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM);2019-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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