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 条
  • [1] A genetic algorithm for maximum-weighted tree matching problem
    Gulek, Mehmet
    Toroslu, Ismail H.
    APPLIED SOFT COMPUTING, 2010, 10 (04) : 1127 - 1131
  • [2] Maximum-weighted matching strategies and the application to symmetric indefinite systems
    Röllin, S
    Schenk, O
    APPLIED PARALLEL COMPUTING: STATE OF THE ART IN SCIENTIFIC COMPUTING, 2006, 3732 : 808 - 817
  • [3] Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs
    Preis, R
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 259 - 269
  • [4] A linear algorithm to find the Steiner tree in Halin networks
    Lu, Yunting
    IMECS 2007: International Multiconference of Engineers and Computer Scientists, Vols I and II, 2007, : 2307 - 2311
  • [5] A Linear Time Algorithm for the Line Subgraph Problem in Halin Graphs
    Lou, Dingjun
    Liang, Jun
    Han, Guanpu
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, SIMULATION AND MODELLING, 2016, 41 : 161 - 164
  • [6] Maximum-Weighted λ-Colorable Subgraph: Revisiting and Applications
    Wan, Peng-Jun
    Yuan, Huaqiang
    Mao, Xufei
    Wang, Jiliang
    Wang, Zhu
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2017, 2017, 10251 : 593 - 604
  • [7] A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
    Koehler, Ekkehard
    Mouatadid, Lalla
    INFORMATION PROCESSING LETTERS, 2016, 116 (06) : 391 - 395
  • [8] Linear time algorithm for maximum distance-k matching in interval graphs
    Viet-Hung Tran
    Duc-Nghia Nguyen
    Phan-Thuan Do
    PROCEEDINGS OF 2018 5TH NAFOSTED CONFERENCE ON INFORMATION AND COMPUTER SCIENCE (NICS 2018), 2018, : 41 - 46
  • [9] A LINEAR-TIME ALGORITHM FOR MAXIMUM-CARDINALITY MATCHING ON COCOMPARABILITY GRAPHS
    Mertzios, George B.
    Nichterlein, Andre
    Niedermeier, Rolf
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (04) : 2820 - 2835
  • [10] An algorithm for constructing the maximum matching graphs on bigraphs
    Li, Jing
    Wang, Shi-Ying
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2010, 38 (01): : 161 - 166
12345