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 条
  • [1] FINDING A MAXIMUM INDEPENDENT SET IN A PERMUTATION GRAPH
    KIM, H
    INFORMATION PROCESSING LETTERS, 1990, 36 (01) : 19 - 23
  • [2] FINDING A MAXIMUM MATCHING IN A CIRCULAR-ARC GRAPH
    LIANG, YD
    RHEE, C
    INFORMATION PROCESSING LETTERS, 1993, 45 (04) : 185 - 190
  • [3] Finding a chain graph in a bipartite permutation graph
    Kiyomi, Masashi
    Otachi, Yota
    INFORMATION PROCESSING LETTERS, 2016, 116 (09) : 569 - 573
  • [4] On the Maximum Matching Graph of a Graph
    SHIYING WANG
    JINJIANG YUAN
    YAN LIU
    YIXUN LIN (Institute of Economics
    运筹学学报, 1998, (02) : 13 - 17
  • [5] 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)
  • [6] 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
  • [7] FINDING MAXIMUM CUT IN A GRAPH
    ORLOVA, GI
    DORFMAN, YG
    ENGINEERING CYBERNETICS, 1972, 10 (03): : 502 - 506
  • [8] Finding cliques of maximum weight on a generalization of permutation graphs
    Cacchiani, Valentina
    Caprara, Alberto
    Toth, Paolo
    OPTIMIZATION LETTERS, 2013, 7 (02) : 289 - 296
  • [9] Finding cliques of maximum weight on a generalization of permutation graphs
    Valentina Cacchiani
    Alberto Caprara
    Paolo Toth
    Optimization Letters, 2013, 7 : 289 - 296
  • [10] On finding graph clusterings with maximum modularity
    Brandes, Ulrik
    Delling, Daniel
    Gaertler, Marco
    Goerke, Robert
    Hoefer, Martin
    Nikoloski, Zoran
    Wagner, Dorothea
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 121 - +
12345