Matching nuts and bolts in O(n log n) time

被引：0
|
作者：
Komlos, J [1 ]
Ma, Y [1 ]
Szemeredi, E [1 ]
机构：
[1] RUTGERS STATE UNIV,DEPT MATH,PISCATAWAY,NJ 08855
来源：
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1996年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：232 / 241
页数：10
相关论文
共 50 条
  • [1] Matching nuts and bolts in O(n log n) time
    Komlos, J
    Ma, Y
    Szemeredi, E
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (03) : 347 - 372
  • [2] NUTS-N-BOLTS
    WORAM, JM
    DB-SOUND ENGINEERING MAGAZINE, 1978, 12 (12): : 48 - &
  • [3] 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
  • [4] AN OPTIMAL O(LOG LOG-N) TIME PARALLEL STRING MATCHING ALGORITHM
    BRESLAUER, D
    GALIL, Z
    SIAM JOURNAL ON COMPUTING, 1990, 19 (06) : 1051 - 1058
  • [5] Fully dynamic maximal matching in O(log n) update time
    Baswana, Surender
    Gupta, Manoj
    Sen, Sandeep
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 383 - 392
  • [6] FULLY DYNAMIC MAXIMAL MATCHING IN O(log n) UPDATE TIME
    Baswana, Surender
    Gupta, Manoj
    Sen, Sandeep
    SIAM JOURNAL ON COMPUTING, 2015, 44 (01) : 88 - 113
  • [7] Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
    Diks, Krzysztof
    Stanczyk, Piotr
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 321 - 333
  • [8] Matching nuts and bolts faster
    Alon, N
    Bradford, PG
    Fleischer, R
    INFORMATION PROCESSING LETTERS, 1996, 59 (03) : 123 - 127
  • [9] NUTS 'N' BOLTS IN 3D.
    Becker, Roger
    Manufacturing Systems, 1987, 5 (01): : 46 - 47
  • [10] BOUNDED ORDERED DICTIONARIES IN O(LOG LOG N) TIME AND O(N) SPACE
    MEHLHORN, K
    NAHER, S
    INFORMATION PROCESSING LETTERS, 1990, 35 (04) : 183 - 189
12345