1 |
Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L. and Tarjan, R. E., 'Linear Time Bounds for Median Computations,' Proceedings of the 4th ACM STOC, pp. 119-124, 1972
DOI
|
2 |
Neapolitan., R. and Naimipour, K., Foundations of Algorithms, pp. 363-392, D. C. Heath and Co., Lexington, 1996
|
3 |
Cormen, T. H., Leiserson, C. E. and Rivest, R. L., Introduction to Algorithms, pp. 86-94, the MIT Press, Cambridge, 1996
|
4 |
Chartrand, G. and Oellermann, O. R., Applied and Algorithmic Graph Theory, pp. 1-88, McGraw-Hill, New York, 1993
|
5 |
한국정보문화진흥원, '버스 노선', 제 18회 한국 정보올림피아드, 2001
|
6 |
Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B. and Yannakakis, M., 'Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problem,' Proceedings of the 31st ACM STOC, pp. 19-28, 1999
DOI
|
7 |
Lukes, J. A., 'Efficient Algorithm for the Partitioning of Trees,' IBM Journal of Research and Development, Vol.18, No.3, pp. 217-224, 1974
|
8 |
Chen, G. H., Kuo, M. T. and Sheu, J. P., 'An Optimal Time Algorithm for Finding a Maximum Weight Independent Set in a Tree,' BIT Numerical Mathematics, Vol.28, pp. 353-356, 1988
DOI
|
9 |
Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 194-195. W. H. Freeman and Co., New York, 1979
|