MAXIMIZING THE NUMBER OF SPANNING-TREES OF NETWORKS BASED ON CYCLE BASIS REPRESENTATION

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	TSENG, SS	en_US
dc.contributor.author	WANG, LR	en_US
dc.date.accessioned	2019-04-02T05:59:02Z	-
dc.date.available	2019-04-02T05:59:02Z	-
dc.date.issued	1989-01-01	en_US
dc.identifier.issn	0020-7160	en_US
dc.identifier.uri	http://dx.doi.org/10.1080/00207168908803727	en_US
dc.identifier.uri	http://hdl.handle.net/11536/149087	-
dc.language.iso	en_US	en_US
dc.title	MAXIMIZING THE NUMBER OF SPANNING-TREES OF NETWORKS BASED ON CYCLE BASIS REPRESENTATION	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1080/00207168908803727	en_US
dc.identifier.journal	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS	en_US
dc.citation.volume	28	en_US
dc.citation.spage	47	en_US
dc.citation.epage	56	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:A1989U741200005	en_US
dc.citation.woscount	5	en_US
顯示於類別：	期刊論文