求有最多函遍樹之網路

Full metadata record

DC Field	Value	Language
dc.contributor.author	王連榮	en_US
dc.contributor.author	WANG, LIAN-RONG	en_US
dc.contributor.author	曾憲雄	en_US
dc.contributor.author	ZENG, XIAN-XIONG	en_US
dc.date.accessioned	2014-12-12T02:05:41Z	-
dc.date.available	2014-12-12T02:05:41Z	-
dc.date.issued	1988	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#NT772394093	en_US
dc.identifier.uri	http://hdl.handle.net/11536/53851	-
dc.description.abstract	本文所討論的題目是給予Ｐ個節點和ｑ個邊後找出此種圖形中含有最多函遍檥的圖形。這個題目只有當ｑ≧Ｐ（Ｐ－１）╱２－〔Ｐ╱２〕和當ｑ＝Ｐ和Ｐ＋１時被解出。對於其它值的Ｐ和ｑ其解仍是未知。我們將在本文中利用循環基底把此問題轉換成非線性整數規化。利用此方法我們將求出ｑ＝Ｐ＋１和Ｐ＋２時的解。	zh_TW
dc.language.iso	zh_TW	en_US
dc.subject	函遍樹	zh_TW
dc.subject	網路	zh_TW
dc.subject	循環基底	zh_TW
dc.subject	整數規化	zh_TW
dc.subject	NETWORK	en_US
dc.subject	CYCLE-BASIS	en_US
dc.title	求有最多函遍樹之網路	zh_TW
dc.type	Thesis	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
Appears in Collections:	Thesis