Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISAAC
/
Paper
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.
Eunjin Oh
,
Hee-Kap Ahn
Venue
B
ISAAC
Year
2016
Proceedings
ISAAC
DBLP record
conf/isaac/0001A16a ↗
Browse the full
ISAAC paper archive
.