共 50 条
- [41] Computing Minimal Triangulations in Time O(nα log n) = o(n2.376) PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 907 - 916
- [43] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest paths ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 411 - 417
- [44] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path Algorithmica, 2008, 51 : 428 - 434
- [49] Matching nuts and bolts in O(n log n) time PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 232 - 241