Backbone analysis and heuristic design for the graph partitioning problem

被引:0
|
作者
Jiang, He [1 ,2 ]
Qiu, Tie [1 ]
机构
[1] School of Software, Dalian University of Technology, Dalian, Liaoning 116621, China
[2] State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
来源
Jisuanji Xuebao/Chinese Journal of Computers | 2009年 / 32卷 / 08期
关键词
D O I
10.3724/SP.J.1016.2009.01662
中图分类号
学科分类号
摘要
引用
收藏
页码:1662 / 1667
相关论文
共 50 条
  • [21] Backbone analysis and algorithm design for the quadratic assignment problem
    He Jiang
    XianChao Zhang
    GuoLiang Chen
    MingChu Li
    Science in China Series F: Information Sciences, 2008, 51 : 476 - 488
  • [22] Backbone analysis and algorithm design for the quadratic assignment problem
    Jiang He
    Zhang XianChao
    Chen GuoLiang
    Li MingChu
    SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (05): : 476 - 488
  • [23] A SET PARTITIONING HEURISTIC FOR THE GENERALIZED ASSIGNMENT PROBLEM
    CATTRYSSE, DG
    SALOMON, M
    VANWASSENHOVE, LN
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (01) : 167 - 174
  • [24] An Efficient Heuristic for the k-Partitioning Problem
    Kalczynski P.
    Goldstein Z.
    Drezner Z.
    Operations Research Forum, 4 (4)
  • [25] An evolutionary heuristic for knowledge base partitioning problem
    Dutta, P
    PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, : 657 - 662
  • [26] Analysis of a heuristic for code partitioning
    Ayed, M
    Gaudiot, JL
    JOURNAL OF SUPERCOMPUTING, 1998, 12 (03): : 191 - 226
  • [27] Analysis of a Heuristic for Code Partitioning
    Moez Ayed
    Jean-Luc Gaudiot
    The Journal of Supercomputing, 1998, 12 : 191 - 226
  • [28] Revisiting the Isoperimetric Graph Partitioning Problem
    Danda, Sravan
    Challa, Aditya
    Sagar, B. S. Daya
    Najman, Laurent
    IEEE ACCESS, 2019, 7 : 50636 - 50649
  • [29] Efficient Algorithms for a Graph Partitioning Problem
    Vaishali, S.
    Atulya, M. S.
    Purohit, Nidhi
    FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 29 - 42
  • [30] Polynomial observables in the graph partitioning problem
    Marchisio, MA
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2001, 12 (01): : 13 - 18