Research on network users archives matching based on maximum weight matching of bipartite graph

被引:0
|
作者
Ding, Yejin [1 ]
机构
[1] College of Humanities, Nanchang University, Nanchang,330031, China
关键词
Compendex;
D O I
10.5013/IJSSST.a.16.2B.16
中图分类号
学科分类号
摘要
User profile
引用
收藏
页码:1 / 16
相关论文
共 50 条
  • [1] Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
    Barketau, Maksim
    Pesch, Erwin
    Shafransky, Yakov
    DISCRETE APPLIED MATHEMATICS, 2015, 196 : 4 - 19
  • [2] MAXIMUM MATCHING IN A CONVEX BIPARTITE GRAPH
    GLOVER, F
    NAVAL RESEARCH LOGISTICS QUARTERLY, 1967, 14 (03): : 313 - &
  • [3] GRAPH SEARCH ALGORITHMS AND MAXIMUM BIPARTITE MATCHING ALGORITHM ON THE HYPERCUBE NETWORK MODEL
    SHEU, JP
    KUO, NL
    CHEN, GH
    PARALLEL COMPUTING, 1990, 13 (02) : 245 - 251
  • [4] Weakly Supervised Segmentation with Maximum Bipartite Graph Matching
    Liu, Weide
    Zhang, Chi
    Lin, Guosheng
    Hung, Tzu-Yi
    Miao, Chunyan
    MM '20: PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, 2020, : 2085 - 2094
  • [5] ONTOLOGY MATCHING BASED ON BIPARTITE GRAPH
    Zhang, Lingyu
    Mi, Jiwei
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2022, 23 (10) : 2117 - 2138
  • [7] Word alignment between Chinese and Japanese using maximum weight matching on bipartite graph
    Natural Language Processing Lab., Institute of Software and Theory, Northeastern University, Shenyang, 110004, China
    不详
    Lect. Notes Comput. Sci., (75-84):
  • [8] Word alignment between Chinese and Japanese using maximum weight matching on bipartite graph
    Wu, Honglin
    Liu, Shaoming
    COMPUTER PROCESSING OF ORIENTAL LANGUAGES, PROCEEDINGS: BEYOND THE ORIENT: THE RESEARCH CHALLENGES AHEAD, 2006, 4285 : 75 - +
  • [9] Boolean matching algorithm based on the perfect matching of the bipartite graph
    Lu, ZW
    Lin, ZH
    Lei, Z
    2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, 2001, : 150 - 154
  • [10] Maximum weight bipartite matching in matrix multiplication time
    Sankowski, Piotr
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (44) : 4480 - 4488