AN O(N) TIME ALGORITHM FOR MAXIMUM MATCHING ON COGRAPHS

被引：16
|
作者：
YU, MS
YANG, CH
机构：
[1] Department of Applied Mathematics, National Chung-Hsing University, Taichung
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 47卷 / 02期
关键词：
DATA STRUCTURES; COGRAPH; MATCHING PROBLEM; TREE;
D O I：
10.1016/0020-0190(93)90230-7
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we develop a sequential algorithm for the maximum matching problem on cographs. The input is a parse tree of a cograph. The time complexity is O(n).
引用
收藏
页码：89 / 93
页数：5
相关论文
共 50 条
  • [41] On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
    Kloks, Ton
    Poon, Sheung-Hung
    Ung, Chin-Ting
    Wang, Yue-Li
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 30 : 21 - 28
  • [42] Real-time scheduling algorithm for minimizing maximum weighted error with O(N log N+cN) complexity
    Choi, KH
    Jung, GY
    Kim, T
    Jung, SH
    INFORMATION PROCESSING LETTERS, 1998, 67 (06) : 311 - 315
  • [43] A fast distributed algorithm for approximating the maximum matching
    Czygrinow, A
    Hanckowiak, M
    Szymanska, E
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 252 - 263
  • [44] 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
  • [45] IMPROVEMENT AND REALIZATION FOR THE MAXIMUM WEIGHT MATCHING ALGORITHM
    徐志才
    Journal of Electronics(China), 1989, (03) : 220 - 231
  • [46] THE GENERAL MAXIMUM MATCHING ALGORITHM OF MICALI AND VAZIRANI
    PETERSON, PA
    LOUI, MC
    ALGORITHMICA, 1988, 3 (04) : 511 - 533
  • [47] An Improved Exact Algorithm for Maximum Induced Matching
    Xiao, Mingyu
    Tan, Huan
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 272 - 283
  • [48] Distributed algorithm for better approximation of the maximum matching
    Czygrinow, A
    Hanckowiak, M
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2003, 2697 : 242 - 251
  • [49] A Faster Combinatorial Algorithm for Maximum Bipartite Matching
    Chuzhoy, Julia
    Khanna, Sanjeev
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2185 - 2235
  • [50] An O*(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs
    Chang, Maw-Shang
    Chen, Li-Hsuan
    Hung, Ling-Ju
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (02) : 594 - 607
12345