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 条
  • [1] A LINEAR-TIME ALGORITHM FOR THE MAXIMUM MATCHING PROBLEM ON COGRAPHS
    YU, MS
    YANG, CH
    BIT, 1993, 33 (03): : 420 - 433
  • [2] An o*(1.4786n)-time algorithm for the maximum induced matching problem
    1600, Springer Science and Business Media Deutschland GmbH (20):
  • [3] An O(n) time algorithm for maximum matching in P-4-tidy graphs
    Fouquet, JL
    Parfenoff, I
    Thuillier, H
    INFORMATION PROCESSING LETTERS, 1997, 62 (06) : 281 - 287
  • [4] AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR COGRAPHS
    LIN, R
    OLARIU, S
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 22 (01) : 26 - 36
  • [5] Maximum Bipartite Matching in n2+o(1) Time via a Combinatorial Algorithm
    Chuzhoy, Julia
    Khanna, Sanjeev
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 83 - 94
  • [6] An O(n(log n)3) algorithm for maximum matching in trapezoid graphs
    Ngoc-Khang Le
    Phan-Thuan Do
    PROCEEDINGS OF 2013 IEEE RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES: RESEARCH, INNOVATION, AND VISION FOR THE FUTURE (RIVF), 2013, : 157 - 162
  • [7] An o(n(3))-time maximum-flow algorithm
    Cheriyan, J
    Hagerup, T
    Mehlhorn, K
    SIAM JOURNAL ON COMPUTING, 1996, 25 (06) : 1144 - 1170
  • [8] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
    KIM, T
    CHWA, KY
    INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
  • [9] Finding a maximum matching in a sparse random graph in O(n) expected time
    Chebolu, Prasad
    Frieze, Alan
    Melsted, Pall
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 161 - 172
  • [10] Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
    Chebolu, Prasad
    Frieze, Alan
    Melsted, Pall
    JOURNAL OF THE ACM, 2010, 57 (04)
12345