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 条
  • [21] ExpFinder: Finding Experts by Graph Pattern Matching
    Fan, Wenfei
    Wang, Xin
    Wu, Yinghui
    2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2013, : 1316 - 1319
  • [22] Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
    Barketau, Maksim
    Pesch, Erwin
    Shafransky, Yakov
    DISCRETE APPLIED MATHEMATICS, 2015, 196 : 4 - 19
  • [23] FINDING A MAXIMUM-GENUS GRAPH IMBEDDING
    FURST, ML
    GROSS, JL
    MCGEOCH, LA
    JOURNAL OF THE ACM, 1988, 35 (03) : 523 - 534
  • [24] On two-processor scheduling and maximum matching in permutation graphs
    Ramnath, S
    Sunder, S
    INFORMATION PROCESSING LETTERS, 1996, 57 (06) : 321 - 327
  • [25] MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K-TRACKS
    LEE, DT
    SARRAFZADEH, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 2 - 11
  • [26] Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph
    Honma, Hirotoshi
    Nakajima, Yoko
    Igarashi, Yuta
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (06): : 1161 - 1167
  • [27] On Estimating Maximum Matching Size in Graph Streams
    Assadi, Sepehr
    Khanna, Sanjeev
    Li, Yang
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1723 - 1742
  • [28] Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
    Feldman, Moran
    Szarf, Ariel
    ALGORITHMICA, 2024, 86 (04) : 1173 - 1209
  • [29] Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
    Moran Feldman
    Ariel Szarf
    Algorithmica, 2024, 86 : 1173 - 1209
  • [30] Finding a maximum induced matching in weakly chordal graphs
    Cameron, K
    Sritharan, R
    Tang, YW
    DISCRETE MATHEMATICS, 2003, 266 (1-3) : 133 - 142
12345