A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.
- Title
- A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.
- Authors
- 안희갑; 오은진
- Date Issued
- 2016-12-13
- Publisher
- ISAAC Advisory Committee
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/48088
- Article Type
- Conference
- Citation
- 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016-12-13
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.