FINDING ALL SHORTEST-PATH EDGE SEQUENCES ON A CONVEX POLYHEDRON

Full metadata record

DC Field	Value	Language
dc.contributor.author	HWANG, YH	en_US
dc.contributor.author	CHANG, RC	en_US
dc.contributor.author	TU, HY	en_US
dc.date.accessioned	2014-12-08T15:05:55Z	-
dc.date.available	2014-12-08T15:05:55Z	-
dc.date.issued	1989	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/11536/4452	-
dc.language.iso	en_US	en_US
dc.title	FINDING ALL SHORTEST-PATH EDGE SEQUENCES ON A CONVEX POLYHEDRON	en_US
dc.type	Article	en_US
dc.identifier.journal	LECTURE NOTES IN COMPUTER SCIENCE	en_US
dc.citation.volume	382	en_US
dc.citation.spage	251	en_US
dc.citation.epage	266	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1989AR84800018	-
dc.citation.woscount	3	-
Appears in Collections:	Articles