Author:
Chevalier Cédric,Safro Ilya
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science 1, 237–267 (1976)
2. Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis 11(3), 430–452 (1990)
3. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. BELL System Technical Journal, 291–307 (1970)
4. Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th Design Automation Conference, pp. 175–181. IEEE, Los Alamitos (1982)
5. Bui, T.N., Moon, B.R.: Genetic algorithm and graph partitioning. IEEE Trans. Comput. 45(7), 841–855 (1996)
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decomposition Based Refinement for the Network Interdiction Problem;2023 IEEE High Performance Extreme Computing Conference (HPEC);2023-09-25
2. Decomposition Strategies for Solving a Large-Scale Consistent Vehicle Routing Problem;2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS);2023-08-14
3. Decomposition Strategies for Vehicle Routing Heuristics;INFORMS Journal on Computing;2023-05
4. Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation;2022 IEEE High Performance Extreme Computing Conference (HPEC);2022-09-19
5. Road Traffic Network Division for a Parallel Dynamic Network Loading Algorithm;2022 15th International Conference on Human System Interaction (HSI);2022-07-28