Skip to main content
English
中文
Log In
Log in
Log in with ORCID
NTU Single Sign On
Have you forgotten your password?
Home
College of Electrical Engineering and Computer Science / 電機資訊學院
Computer Science and Information Engineering / 資訊工程學系
A fast approximation algorithm for maximum-leaf spanning tree
Details
A fast approximation algorithm for maximum-leaf spanning tree
Journal
3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997
Pages
351-356
Date Issued
1997
Author(s)
Lu, H.-I.
HSUEH-I LU
DOI
10.1109/ISPAN.1997.645119
URI
https://scholars.lib.ntu.edu.tw/handle/123456789/488616
URL
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85060814010&doi=10.1109%2fISPAN.1997.645119&partnerID=40&md5=8545ebc4ee6b8de1c81133c381af4390
Type
conference paper
