Tight Time Bounds for the Minimum Local Convex Partition Problem

2005 ◽  
pp. 95-105
Author(s):  
Magdalene Grantson ◽  
Christos Levcopoulos
Keyword(s):  
Partition Problem ◽  
Convex Partition ◽  
Local Convex ◽  
Time Bounds

A Note on the Value in the Disjoint Convex Partition Problem

2018 ◽  
Vol 104 (1-2) ◽  
pp. 135-149 ◽  
Author(s):  
Xinshang You ◽  
Tong Chen
Keyword(s):  
Partition Problem ◽  
Convex Partition ◽  
Disjoint Convex

The d-Subtree Partition Problem

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

scholarly journals The construction of local convex hull on the task of pattern recognition

2021 ◽  
Vol 186 ◽  
pp. 360-365
Author(s):  
Kamilov Mirzoyan ◽  
Hudayberdiev Mirzaakbar ◽  
Khamroev Alisher
Keyword(s):  
Pattern Recognition ◽  
Convex Hull ◽  
Local Convex

Anisotropic simplicial meshing using local convex functions

2014 ◽  
Vol 33 (6) ◽  
pp. 1-11 ◽  
Author(s):  
Xiao-Ming Fu ◽  
Yang Liu ◽  
John Snyder ◽  
Baining Guo
Keyword(s):  
Convex Functions ◽  
Local Convex

scholarly journals A new multi-level algorithm for balanced partition problem on large scale directed graphs

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Xianyue Li ◽  
Yufei Pang ◽  
Chenxia Zhao ◽  
Yang Liu ◽  
Qingzhen Dong
Keyword(s):  
Large Scale ◽  
Directed Graphs ◽  
Vlsi Design ◽  
Graph Partition ◽  
Partition Problem ◽  
Multi Level ◽  
The Stability ◽  
Recursive Partition ◽  
Balanced Partition ◽  
Partition Method

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.

Sign in / Sign up

Export Citation Format

Share Document