FINDING A MAXIMUM MATCHING IN A PERMUTATION GRAPH

被引：0
|
作者：
RHEE, C [1 ]
LIANG, YD [1 ]
机构：
[1] INDIANA UNIV PURDUE UNIV,DEPT COMP SCI,FT WAYNE,IN 46805
来源：
ACTA INFORMATICA | 1995年 / 32卷 / 08期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present an O(n log log n) time algorithm for finding a maximum matching in a permutation graph with n vertices, assuming that the input graph is represented by a permutation.
引用
收藏
页码：779 / 792
页数：14
相关论文
共 50 条
  • [41] FINDING THE GRAPH WITH THE MAXIMUM NUMBER OF SPANNING-TREES
    MOUSTAKIDES, G
    BEDROSIAN, SD
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1980, 310 (06): : 343 - 348
  • [42] Finding a maximum independent set in a sparse random graph
    Feige, U
    Ofek, E
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 282 - 293
  • [43] 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
  • [44] Maximum Size of a Graph with Given Fractional Matching Number
    Ma, Tianlong
    Qian, Jianguo
    Shi, Chao
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (03):
  • [45] Weakly Supervised Segmentation with Maximum Bipartite Graph Matching
    Liu, Weide
    Zhang, Chi
    Lin, Guosheng
    Hung, Tzu-Yi
    Miao, Chunyan
    MM '20: PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, 2020, : 2085 - 2094
  • [46] A distributed self-stabilizing algorithm for finding maximum matching
    Karaata, MH
    Saleh, KA
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2000, 15 (03): : 175 - 180
  • [47] FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS
    TSENG, FSC
    YANG, WP
    CHEN, ALP
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1993, 25 (05) : 65 - 71
  • [48] Matching 2-lattice polyhedra: finding a maximum vector
    Chang, SY
    Llewellyn, DC
    Vate, JHV
    DISCRETE MATHEMATICS, 2001, 237 (1-3) : 29 - 61
  • [49] Finding a maximum-weight convex set in a chordal graph
    Cardinal J.
    Doignon J.-P.
    Merckx K.
    Journal of Graph Algorithms and Applications, 2019, 23 (02) : 167 - 190
  • [50] Method of the Maximum Dynamic Flow Finding in the Fuzzy Graph with Gains
    Kureichik, Victor
    Gerasimenko, Evgeniya
    PROCEEDINGS OF THE THIRD INTERNATIONAL SCIENTIFIC CONFERENCE INTELLIGENT INFORMATION TECHNOLOGIES FOR INDUSTRY (IITI'18), VOL 1, 2019, 874 : 244 - 253
12345