 | Tao Jiang - 1997 - 540 sider
...Babu 0. Narayanan, Mike Paterson, and Mikkel Thorup. On the approximability of numerical taxonomy. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 365—372, 1996. [BD86] Hans-Jürgen Bandelt and Andreas Dress. Reconstructing the shape of a tree... | |
 | Rolf H. Möhring - 1997 - 392 sider
...generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 448-457, Atlanta, Georgia, 28-30 January 1996. Bicliques in Graphs II: Recognizing fc-Path Graphs and... | |
 | Chin-Sheng Chen, Joaquim Filipe, Isabel Seruca, José Cordeiro - 2007 - 263 sider
...Database Syst, 2(1): 1 1-26. Clark, DR and Munro, JI (1996). Efficient suffix trees on secondary storage. In Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, pages 383-391, Atlanta, Georgia, United States. Society for Industrial and Applied Mathematics. Comer, D.... | |
| |
In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 42-5 1 , New York/Philadelphia, Jan. 