Efficient multiple-way network-partitioning algorithm-Reference-Cited by-同舟云学术

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

Efficient multiple-way network-partitioning algorithm

Published:1993-05 Issue:5 Volume:25 Page:269-280
ISSN:0010-4485
Container-title:Computer-Aided Design
language:en
Short-container-title:Computer-Aided Design

Author:

Kim J.-U.,Lee C.-H.,Kim M.

Publisher

Elsevier BV

Subject

Industrial and Manufacturing Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications

Reference18 articles.

1. A class of min-cut placement algorithms;Breuer,1977

2. A placement capability based on partitioning;Corrigan,1979

3. Heuristic methods for process assignment in distributed computing systems;Arora,1980

4. Heuristic models of task assignment scheduling in distributed systems;Efe;IEEE Comput.,1982

5. An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems;Lee,1990

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

1. Dynamic Iterative Method for Fast Network Partitioning;High Performance Computing and Networking;2000

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP