Graph partitioning: an updated survey-Reference-Cited by-同舟云学术

Graph partitioning: an updated survey

Published:2022-11-22 Issue: Volume: Page:1-11
ISSN:0972-8600
Container-title:AKCE International Journal of Graphs and Combinatorics
language:en
Short-container-title:AKCE International Journal of Graphs and Combinatorics

Author:

Wu Shufei¹,Hou Jianfeng²

Affiliation:

1. School of Mathematics and Information Science, Henan Polytechnic University, Henan, China

2. Center of Discrete Mathematics, Fuzhou University, Fujian, China

Funder

National Natural Science Foundation of China

Publisher

Informa UK Limited

Subject

Discrete Mathematics and Combinatorics

Link

https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2148589

Reference125 articles.

1. Bipartite subgraphs

2. Maximum directed cuts in acyclic digraphs

3. Maximum cuts and judicious partitions in graphs without short cycles

4. MaxCut in ${\bm H)$-Free Graphs

5. Ashcraft, C. C., Liu, J. W. H. (1995). Using domain decomposition to find graph bisectors. Technical report CS-95-08. North York, Canada: York University.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum bisections of graphs without cycles of length four and five;Discrete Applied Mathematics;2025-01

2. Distributed algorithm for parallel computation of the n queens solutions;Expert Systems with Applications;2024-12

3. Bridge-Rhombus Transformation to Solve Partitioning Problem in Telecommunications Network;2024 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC);2024-07-02

4. A NOTE ON JUDICIOUS BISECTIONS OF GRAPHS;Bulletin of the Australian Mathematical Society;2024-03-08

5. Optimal bisections of directed graphs;Random Structures & Algorithms;2023-08-02