Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
Author:
Affiliation:
1. Sapienza Università di Roma; Italy
2. IMUS, Instituto de Matemáticas de la Universidad de Sevilla; Spain
3. Università degli Studi Niccolò Cusano; Roma Italy
Funder
Spanish Ministry of Science and Technology
Junta de Andalucía
Publisher
Wiley
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Link
http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21661/fullpdf
Reference44 articles.
1. A survey on clustering algorithms for wireless sensor networks;Abbasi;Comput Commun,2007
2. A shifting algorithm for constrained min-max partition on trees;Agasi;Discr Appl Math,1993
3. Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs;Apollonio;Networks,2008
4. How to allocate network centers;Bar-Ilan;J Algorithm,1993
5. Y. Bartal On approximating arbitrary metrics by tree metrics 1998 161 168
Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows;Algorithmica;2022-12-29
2. An overview of graph covering and partitioning;Discrete Mathematics;2022-08
3. Reconfiguration of connected graph partitions via recombination;Theoretical Computer Science;2022-06
4. Partitioning a Graph Constraining the Weight of its Cuts;SSRN Electronic Journal;2022
5. Metaheuristics for the Minimum Gap Graph Partitioning Problem;Computers & Operations Research;2021-08
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3