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 条

[31] An O(n(m plus n log n) log n) time algorithm to solve the minimum cost tension problem
Ghiyasvand, Mehdi
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (03) : 957 - 969
[32] COMPUTING THE GIRTH OF A PLANAR GRAPH IN O(n log n) TIME
Weimann, Oren
Yuster, Raphael
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (02) : 609 - 616
[33] Determining the visibility of a planar set of line segments in O(n log log n) time
Devai, Frank
Gavrilova, Marina L.
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 2, PROCEEDINGS, 2007, 4706 : 51 - 62
[34] Computing the Girth of a Planar Graph in O (n log n) Time
Weimann, Oren
Yuster, Raphael
AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 764 - +
[35] FINDING CONNECTED COMPONENTS IN O(LOG-N LOG LOG-N) TIME ON THE EREW PRAM
CHONG, KW
LAM, TW
JOURNAL OF ALGORITHMS, 1995, 18 (03) : 378 - 402
[36] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest paths
Han, Yijie
ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 411 - 417
[37] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path
Yijie Han
Algorithmica, 2008, 51 : 428 - 434
[38] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest path
Han, Yijie
ALGORITHMICA, 2008, 51 (04) : 428 - 434
[39] An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
Takaoka, T
INFORMATION PROCESSING LETTERS, 2005, 96 (05) : 155 - 161
[40] FINDING THE UPPER ENVELOPE OF N LINE SEGMENTS IN O(N LOG N) TIME
HERSHBERGER, J
INFORMATION PROCESSING LETTERS, 1989, 33 (04) : 169 - 174

← 1 2 3 4 5 →