Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISCAS
/
Paper
A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon.
Guo-Hui Lin
,
Guoliang Xue
Venue
C
ISCAS
Year
2000
Proceedings
ISCAS
DBLP record
conf/iscas/LinX00 ↗
Browse the full
ISCAS paper archive
.