UNORDERED TREE CONTRACTION

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	HSU, LH	en_US
dc.contributor.author	WANG, JJJ	en_US
dc.date.accessioned	2014-12-08T15:05:23Z	-
dc.date.available	2014-12-08T15:05:23Z	-
dc.date.issued	1991	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3925	-
dc.description.abstract	The tree contraction problem is for reducing a rooted tree to its root by a sequence of independent vertex removals. All of the previous research works are concentrated on ordered rooted tree whereas in this paper we are going to discuss the case of unordered rooted tree.	en_US
dc.language.iso	en_US	en_US
dc.title	UNORDERED TREE CONTRACTION	en_US
dc.type	Article	en_US
dc.identifier.journal	LECTURE NOTES IN COMPUTER SCIENCE	en_US
dc.citation.volume	497	en_US
dc.citation.spage	347	en_US
dc.citation.epage	349	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1991FW90100035	-
dc.citation.woscount	0	-
顯示於類別：	期刊論文