圖形上的帶寬問題

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	李宗儒	en_US
dc.contributor.author	Chung-Ru Lee	en_US
dc.contributor.author	張鎮華	en_US
dc.contributor.author	Gerard J. Chang	en_US
dc.date.accessioned	2014-12-12T02:29:05Z	-
dc.date.available	2014-12-12T02:29:05Z	-
dc.date.issued	2001	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#NT900507020	en_US
dc.identifier.uri	http://hdl.handle.net/11536/69316	-
dc.description.abstract	本篇論文所探討的是增殖圖上的帶寬問題。更詳細來說，我們解決了有某些條件的常數增殖圖上的帶寬問題，及提供一些增殖路徑圖的答案	zh_TW
dc.description.abstract	This thesis investigates the bandwidth problem for multiplications of graphs. In particular, we solve the bandwidth problem for constant multiplications of graphs with certain conditions. We also give solution to some multiplications of paths.	en_US
dc.language.iso	en_US	en_US
dc.subject	圖形	zh_TW
dc.subject	帶寬	zh_TW
dc.subject	增殖圖	zh_TW
dc.subject	graph	en_US
dc.subject	bandwidth	en_US
dc.subject	multiplication	en_US
dc.title	圖形上的帶寬問題	zh_TW
dc.title	The Bandwidth Problem on Graphs	en_US
dc.type	Thesis	en_US
dc.contributor.department	應用數學系所	zh_TW
顯示於類別：	畢業論文