Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. D. Avis. A survey of heuristics for the weighted matching problem. Networks, 13:475–493, 1983.
2. B. Boyens. Schrumpfungstechniken zur effizienten Graphpartitionierung. Diplom-Thesis, Universität Paderborn, Germany, June 1998. (in German).
3. H.N. Gabow. Data structures for weighted matching and nearest common ancestors with linking. ACM-SIAM Symposium on Discrete Algorithms., pages 434–443, 1990.
4. H.N. Gabow and R.E. Tarjan. Faster scaling algorithms for general graph-matching problems. Journal of the ACM, 38(4):815–853, 1991.
5. M.R. Garey, D.S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267, 1976.
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Toward Rapid and Optimal Strategy for Swarm Conflict: A Computational Game Approach;IEEE Transactions on Aerospace and Electronic Systems;2024-06
2. cuAlign: Scalable Network Alignment on GPU Accelerators;Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis;2023-11-12
3. A Parallel Network Alignment Algorithm for Biological Networks;2022 3rd International Informatics and Software Engineering Conference (IISEC);2022-12-15
4. Secure Maximum Weight Matching Approximation on General Graphs;Proceedings of the 21st Workshop on Privacy in the Electronic Society;2022-11-07
5. Conflict-Aware Pseudo Labeling via Optimal Transport for Entity Alignment;2022 IEEE International Conference on Data Mining (ICDM);2022-11