Statistically optimal graph partition method based on modularity

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.

Download Full-text

A Robust Graph Partition Method from the Path-Weighted Adjacency Matrix

Graph-Based Representations in Pattern Recognition - Lecture Notes in Computer Science ◽

10.1007/978-3-540-31988-7_35 ◽

2005 ◽

pp. 362-372

Author(s):

Huaijun Qiu ◽

Edwin R. Hancock

Keyword(s):

Adjacency Matrix ◽

Graph Partition ◽

Partition Method ◽

Weighted Adjacency Matrix

Download Full-text

An efficient graph partition method for fault section estimation in large-scale power network

2001 IEEE Power Engineering Society Winter Meeting Conference Proceedings (Cat No 01CH37194) PESW-01 ◽

10.1109/pesw.2001.917278 ◽

2002 ◽

Author(s):

Tianshu Bi ◽

Yixin Ni ◽

C.M. Shen ◽

F.F. Wu

Keyword(s):

Large Scale ◽

Graph Partition ◽

Power Network ◽

Partition Method

Download Full-text

A New Multi-level Algorithms for Balanced Partition Problem on Large Scale Directed Graphs

10.21203/rs.3.rs-359089/v1 ◽

2021 ◽

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

Abstract Graph 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 case 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.

Download Full-text