<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

FINDING ALL SHORTEST-PATH EDGE SEQUENCES ON A CONVEX POLYHEDRON

dc.citation.epage266en_US
dc.citation.spage251en_US
dc.citation.volume382en_US
dc.citation.woscount3
dc.contributor.authorHWANG, YHen_US
dc.contributor.authorCHANG, RCen_US
dc.contributor.authorTU, HYen_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.date.accessioned2014-12-08T15:05:55Z
dc.date.available2014-12-08T15:05:55Z
dc.date.issued1989en_US
dc.identifier.issn0302-9743en_US
dc.identifier.journalLECTURE NOTES IN COMPUTER SCIENCEen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/4452
dc.identifier.wosnumberWOS:A1989AR84800018
dc.language.isoen_USen_US
dc.titleFINDING ALL SHORTEST-PATH EDGE SEQUENCES ON A CONVEX POLYHEDRONen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: