user

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 条
  • [31] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHING IN GRAPHS.
    Galil, Zvi
    Computing surveys, 1986, 18 (01): : 23 - 38
  • [32] A linear time algorithm for finding all hinge vertices of a permutation graph
    Ho, TY
    Wang, YL
    Juan, MT
    INFORMATION PROCESSING LETTERS, 1996, 59 (02) : 103 - 107
  • [33] Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
    Viet Dung Nguyen
    Ba Thai Pham
    Phan Thuan
    FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 257 - 283
  • [34] A parallel algorithm for finding a perfect matching in a planar graph
    Bampis, E.
    Giannakos, A.
    Karzanov, A.
    Manoussakis, Y.
    Milis, I.
    Parallel Processing Letters, 1998, 8 (03): : 399 - 405
  • [35] Best odds for finding a perfect matching in a bipartite graph
    Paulsen, W.
    COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (05): : 753 - 763
  • [36] Finding a maximum independent set in a sparse random graph
    Feige, Uriel
    Ofek, Eran
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (02) : 693 - 718
  • [37] FINDING A MAXIMUM WEIGHT INDEPENDENT SET OF A CIRCLE GRAPH
    ASANO, T
    IMAI, H
    MUKAIYAMA, A
    IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS, 1991, 74 (04): : 681 - 683
  • [38] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM CLIQUES OF AN OVERLAP GRAPH
    MASUDA, S
    NAKAJIMA, K
    KASHIWABARA, T
    FUJISAWA, T
    NETWORKS, 1990, 20 (02) : 157 - 171
  • [39] 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
  • [40] Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
    Bojic, Alan
    JOURNAL OF INFORMATION AND ORGANIZATIONAL SCIENCES, 2012, 36 (02) : 91 - 98
12345