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 条
  • [21] A linear algorithm for a perfect matching in polyomino graphs
    Lin, Yuqing
    Zhang, Fuji
    THEORETICAL COMPUTER SCIENCE, 2017, 675 : 82 - 88
  • [22] An Algorithm to Find the Constrained Steiner Tree in Halin Networks
    Lu, Yunting
    Li, Zhenjun
    Li, Min
    FGCN: PROCEEDINGS OF THE 2008 SECOND INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING, VOLS 1 AND 2, 2008, : 421 - +
  • [23] An Algorithm to Find the kth shortest Path in Halin Networks
    Lu, Yunting
    Li, Zhenjun
    2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION WORKSHOP: IITA 2008 WORKSHOPS, PROCEEDINGS, 2008, : 698 - +
  • [24] Solving maximum weighted matching on large graphs with deep reinforcement learning
    Wu, Bohao
    Li, Lingli
    INFORMATION SCIENCES, 2022, 614 : 400 - 415
  • [25] An exact algorithm to find a maximum weight clique in a weighted undirected graph
    Rozman, Kati
    Ghysels, An
    Janezic, Dusanka
    Konc, Janez
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [26] AVDITC of Generalized Halin Graphs with Maximum Degree at Least 6
    Yang, Sui-yi
    Wen, Fei
    INTERNATIONAL CONFERENCE ON ELECTRICAL, CONTROL AND AUTOMATION ENGINEERING (ECAE 2013), 2013, : 179 - 182
  • [27] WSM: a novel algorithm for subgraph matching in large weighted graphs
    Anupam Bhattacharjee
    Hasan M. Jamil
    Journal of Intelligent Information Systems, 2012, 38 : 767 - 784
  • [28] Maximum-Weighted Subset of Communication Requests Schedulable without Spectral Splitting
    Wan, Peng-Jun
    Yuan, Huaqiang
    Jia, Xiaohua
    Wang, Jiliang
    Wang, Zhu
    IEEE INFOCOM 2017 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2017,
  • [29] WSM: a novel algorithm for subgraph matching in large weighted graphs
    Bhattacharjee, Anupam
    Jamil, Hasan M.
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 38 (03) : 767 - 784
  • [30] 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
12345