scholarly journals Inapproximability of the Minimum Biclique Edge Partition Problem

2010 ◽  
Vol E93-D (2) ◽  
pp. 290-292
Author(s):  
Hideaki OTSUKI ◽  
Tomio HIRATA
Keyword(s):  
Partition Problem ◽  
Edge Partition

The SONET edge-partition problem

Networks ◽  
2002 ◽  
Vol 41 (1) ◽  
pp. 13-23 ◽  
Author(s):  
Olivier Goldschmidt ◽  
Dorit S. Hochbaum ◽  
Asaf Levin ◽  
Eli V. Olinick
Keyword(s):  
Partition Problem ◽  
Edge Partition

scholarly journals Cutting plane algorithms for solving a stochastic edge-partition problem

2009 ◽  
Vol 6 (4) ◽  
pp. 420-435 ◽  
Author(s):  
Z. Caner Taşkın ◽  
J. Cole Smith ◽  
Shabbir Ahmed ◽  
Andrew J. Schaefer
Keyword(s):  
Cutting Plane ◽  
Partition Problem ◽  
Cutting Plane Algorithms ◽  
Edge Partition

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

A Level Set Method for the Dirichlet k-Partition Problem

2021 ◽  
Vol 86 (1) ◽  
Author(s):  
Kwunlun Chu ◽  
Shingyu Leung
Keyword(s):  
Level Set Method ◽  
Level Set ◽  
Partition Problem

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.

The NP-Completeness of Some Edge-Partition Problems

1981 ◽  
Vol 10 (4) ◽  
pp. 713-717 ◽  
Author(s):  
Ian Holyer
Keyword(s):  
Np Completeness ◽  
Edge Partition

On a set-theoretic partition problem

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

A Generalization of the Partition Problem

2015 ◽  
Vol 34 (4) ◽  
pp. 483-503
Author(s):  
Tumulesh K. S. Solanky ◽  
Jie Zhou
Keyword(s):  
Partition Problem
Sign in / Sign up

Export Citation Format

Share Document