A linear algorithm to find the maximum-weighted matching in halin graphs

被引：0
|
作者：
Lu, Yunting [1 ]
Li, Yueping [1 ]
Lou, Dingjun [1 ]
机构：
[1] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Guangdong, Peoples R China
来源：
IMECS 2007: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II | 2007年
关键词：
maximum-weighted; matching; Halin graph; algorithm;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Finding a matching with the maximum total weight is the wellkonwn assignment problem of assigning people to jobs and maximize the profits. In this paper, we focus on finding the maximum-weighted matching in Halin graphs. First, we review the method of "shrinking fan". Second, we show how to use the method in finding the maximum-weighted matching in Hatin graphs and then a linear algorithm is designed to solve this problem. Finally, it is shown that the algorithm can be easily extended to solve many relative problems.
引用
收藏
页码：2274 / +
页数：2
相关论文
共 50 条
  • [41] AVDTC numbers of generalized Halin graphs with maximum degree at least 6
    Chen, Xiang-en
    Zhang, Zhong-fu
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2008, 24 (01): : 55 - 58
  • [42] A note on the total chromatic number of Halin graphs with maximum degree 4
    Zhang, ZF
    Li, LZ
    Wang, JF
    Li, HX
    APPLIED MATHEMATICS LETTERS, 1998, 11 (05) : 23 - 27
  • [43] AN O(EVLOGV) ALGORITHM FOR FINDING A MAXIMAL WEIGHTED MATCHING IN GENERAL GRAPHS
    GALIL, Z
    MICALI, S
    GABOW, H
    SIAM JOURNAL ON COMPUTING, 1986, 15 (01) : 120 - 130
  • [44] A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching
    Angriman E.
    Boroń M.
    Meyerhenke H.
    ACM Journal of Experimental Algorithmics, 2022, 27 (01):
  • [45] Maximum random fuzzy weighted matching models and hybrid genetic algorithm
    Gao, Xiaofeng
    Liu, Linzhong
    Proceedings of the Fourth International Conference on Information and Management Sciences, 2005, 4 : 466 - 472
  • [46] A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
    Kimmel, Shelby
    Witter, R. Teal
    ALGORITHMS AND DATA STRUCTURES, WADS 2021, 2021, 12808 : 543 - 555
  • [47] A dynamic programming algorithm for the maximum induced matching problem in permutation graphs
    Viet-Dung Nguyen
    Ba-Thai Pham
    Viet-Hung Tran
    Phan-Thuan Do
    PROCEEDINGS OF THE NINTH INTERNATIONAL SYMPOSIUM ON INFORMATION AND COMMUNICATION TECHNOLOGY (SOICT 2018), 2018, : 92 - 97
  • [48] Quadratic time algorithm for maximum induced matching problem in trapezoid graphs
    Viet-Dung Nguyen
    Phan-Thuan Do
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND SYSTEMS (ICISS 2019), 2019, : 185 - 189
  • [49] THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS
    LIU Yan(Department of Mathematics
    Journal of Systems Science & Complexity, 2004, (01) : 33 - 38
  • [50] THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS
    LIU YanDepartment of Mathematics South China Normal University Guangzhou ChinaWANG Shiying Department of Mathematics Shanxi University Taiyuan China
    JournalofSystemsScienceandComplexity, 2004, (01) : 33 - 38
12345