Stable Partition Problem, 2002; Cechlárová, Hajduková

2008 ◽  
pp. 885-888 ◽  
Author(s):  
Katarína Cechlárová

2016 ◽  
pp. 2075-2078
Author(s):  
Katarína Cechlárová

2010 ◽  
Vol 33 (4) ◽  
pp. 652-665
Author(s):  
Yan-Guang CAI ◽  
Yun ZHANG ◽  
Ji-Xin QIAN
Keyword(s):  

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Xianyue Li ◽  
Yufei Pang ◽  
Chenxia Zhao ◽  
Yang Liu ◽  
Qingzhen Dong

AbstractGraph partition is a classical combinatorial optimization and graph theory problem, and it has a lot of applications, such as scientific computing, VLSI design and clustering etc. In this paper, we study the partition problem on large scale directed graphs under a new objective function, a new instance of graph partition problem. We firstly propose the modeling of this problem, then design an algorithm based on multi-level strategy and recursive partition method, and finally do a lot of simulation experiments. The experimental results verify the stability of our algorithm and show that our algorithm has the same good performance as METIS. In addition, our algorithm is better than METIS on unbalanced ratio.


1972 ◽  
Vol 39 (1) ◽  
pp. 77-83 ◽  
Author(s):  
Karel Prikry
Keyword(s):  

2015 ◽  
Vol 34 (4) ◽  
pp. 483-503
Author(s):  
Tumulesh K. S. Solanky ◽  
Jie Zhou
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document