See the published version of this preprint at Advances in Aerodynamics.
This is a preprint, a preliminary version of a manuscript that has not completed peer review at a journal. Research Square does not conduct peer review prior to posting preprints. The posting of a preprint on this server should not be interpreted as an endorsement of its validity or suitability for dissemination as established information or for guiding clinical practice.
Learn more about In Review
A new preprint design is coming!
We have improved readability, clarity, accessibility, and opportunities for engagement.
Research
License:
This work is licensed under a CC BY 4.0 License. Read Full License
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.
Keywords
Graph Partition Problem, Large Scale Graphs, Directed Graphs, Multi-level Strategy
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Loading...
Badges
Prescreen
This manuscript passed our Prescreen assessment
Complete author information
Appropriate declaration statements
Potential risks to human health
Prescreen
Peer Review Timeline
CURRENT STATUS: Published
View the published article at Advances in Aerodynamics.
Version 1
Posted 30 Mar, 2021
No community comments so far
Editorial decision: Minor revision
On 23 Apr, 2021
Review #2 received
Received 20 Apr, 2021
Review #1 received
Received 07 Apr, 2021
Reviewer #2 agreed
On 27 Mar, 2021
Reviews received
Received 25 Mar, 2021
Reviewer #1 agreed
On 25 Mar, 2021
Reviewers invited
Invitations sent on 24 Mar, 2021
Submission checks complete
On 23 Mar, 2021
Editor invited
On 23 Mar, 2021
Editor assigned
On 22 Mar, 2021
First submitted
On 22 Mar, 2021
Metrics
Comments: 0
PDF Downloads: ...
HTML Views: ...
Subject Areas
Aeronautics and Astronautics
Learn more about our company.
A new preprint design is coming!
We have improved readability, clarity, accessibility, and opportunities for engagement.
See the published version of this preprint at Advances in Aerodynamics.
This is a preprint, a preliminary version of a manuscript that has not completed peer review at a journal. Research Square does not conduct peer review prior to posting preprints. The posting of a preprint on this server should not be interpreted as an endorsement of its validity or suitability for dissemination as established information or for guiding clinical practice.
Learn more about In Review
Research
Badges
Prescreen
This manuscript passed our Prescreen assessment
Complete author information
Appropriate declaration statements
Potential risks to human health
Prescreen
Peer Review Timeline
CURRENT STATUS: Published
View the published article at Advances in Aerodynamics.
Version 1
Posted 30 Mar, 2021
No community comments so far
Editorial decision: Minor revision
On 23 Apr, 2021
Review #2 received
Received 20 Apr, 2021
Review #1 received
Received 07 Apr, 2021
Reviewer #2 agreed
On 27 Mar, 2021
Reviews received
Received 25 Mar, 2021
Reviewer #1 agreed
On 25 Mar, 2021
Reviewers invited
Invitations sent on 24 Mar, 2021
Submission checks complete
On 23 Mar, 2021
Editor invited
On 23 Mar, 2021
Editor assigned
On 22 Mar, 2021
First submitted
On 22 Mar, 2021
Metrics
Comments: 0
PDF Downloads: ...
HTML Views: ...
Subject Areas
Aeronautics and Astronautics
License:
This work is licensed under a CC BY 4.0 License. Read Full License
View the published article at Advances in Aerodynamics.
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.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Loading...