AN O(N LOG N) MINIMAL SPANNING TREE ALGORITHM FOR N-POINTS IN THE PLANE

Full metadata record

DC Field	Value	Language
dc.contributor.author	CHANG, RC	en_US
dc.contributor.author	LEE, RCT	en_US
dc.date.accessioned	2014-12-08T15:06:12Z	-
dc.date.available	2014-12-08T15:06:12Z	-
dc.date.issued	1986	en_US
dc.identifier.issn	0006-3835	en_US
dc.identifier.uri	http://hdl.handle.net/11536/4775	-
dc.identifier.uri	http://dx.doi.org/10.1007/BF01939358	en_US
dc.language.iso	en_US	en_US
dc.title	AN O(N LOG N) MINIMAL SPANNING TREE ALGORITHM FOR N-POINTS IN THE PLANE	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/BF01939358	en_US
dc.identifier.journal	BIT	en_US
dc.citation.volume	26	en_US
dc.citation.issue	1	en_US
dc.citation.spage	7	en_US
dc.citation.epage	16	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.identifier.wosnumber	WOS:A1986C251200002	-
dc.citation.woscount	9	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.