FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS

被引：0
|
作者：
TSENG, FSC
YANG, WP
CHEN, ALP
机构：
[1] NATL TSING HUA UNIV,DEPT COMP SCI,HSINCHU 30043,TAIWAN
[2] NATL CHIAO TUNG UNIV,DEPT COMP SCI & INFORMAT ENGN,HSINCHU 30050,TAIWAN
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1993年 / 25卷 / 05期
关键词：
D O I：
10.1016/0898-1221(93)90199-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The traditional bipartite weighted matching problem is to maximize the largest possible sum of weights. In this paper, we define a bipartite matching problem which maximizes the largest possible product of weights and develop an algorithm to solve it. Although this problem corresponds to a non-linear program, we show this problem can be easily solved by modifying the Hungarian method. Finally, we present an application of this problem.
引用
收藏
页码：65 / 71
页数：7
相关论文
共 50 条
  • [21] Web service discovery based on maximum weighted bipartite graphs
    Chen, Kuo
    Kuang, Cuiping
    COMPUTER COMMUNICATIONS, 2021, 171 : 54 - 60
  • [22] Computing Maximum Matching in Parallel on Bipartite Graphs: Worth the Effort?
    Azad, Ariful
    Halappanavar, Mahantesh
    Dobrian, Florin
    Pothen, Alex
    PROCEEDINGS OF THE FIRST WORKSHOP ON IRREGULAR APPLICATIONS: ARCHITECTURES AND ALGORITHM (IAAA'11), 2011, : 11 - 14
  • [23] BSP/CGM algorithm for maximum matching in convex bipartite graphs
    Soares, J
    Stefanes, M
    15TH SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 2003, : 167 - 174
  • [24] CIRCULAR CONVEX BIPARTITE GRAPHS - MAXIMUM MATCHING AND HAMILTONIAN CIRCUITS
    LIANG, YD
    BLUM, N
    INFORMATION PROCESSING LETTERS, 1995, 56 (04) : 215 - 219
  • [25] Maximum weight induced matching in some subclasses of bipartite graphs
    Panda, B. S.
    Pandey, Arti
    Chaudhary, Juhi
    Dane, Piyush
    Kashyap, Manav
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (03) : 713 - 732
  • [26] Maximum weight induced matching in some subclasses of bipartite graphs
    B. S. Panda
    Arti Pandey
    Juhi Chaudhary
    Piyush Dane
    Manav Kashyap
    Journal of Combinatorial Optimization, 2020, 40 : 713 - 732
  • [27] Iterative message passing algorithm for bipartite maximum weighted matching
    Cheng, Yuan-sheng
    Neely, Michael
    Chugg, Keith M.
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 1934 - +
  • [28] Coarse grained parallel maximum matching in convex bipartite graphs
    Bose, P
    Chan, A
    Dehne, F
    Latzel, M
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 125 - 129
  • [29] GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
    Deveci, Mehmet
    Kaya, Kamer
    Ucar, Bora
    Catalyuerek, Uemit V.
    EURO-PAR 2013 PARALLEL PROCESSING, 2013, 8097 : 850 - 861
  • [30] A bio-inspired algorithm for maximum matching in bipartite graphs
    Qi, Chunxia
    Diao, Jiandong
    IAENG International Journal of Computer Science, 2020, 47 (01) : 56 - 60
12345