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

Full metadata record

DC Field	Value	Language
dc.contributor.author	TSENG, SS	en_US
dc.contributor.author	WANG, LR	en_US
dc.date.accessioned	2014-12-08T15:05:54Z	-
dc.date.available	2014-12-08T15:05:54Z	-
dc.date.issued	1989	en_US
dc.identifier.issn	0020-7160	en_US
dc.identifier.uri	http://hdl.handle.net/11536/4432	-
dc.identifier.uri	http://dx.doi.org/10.1080/00207168908803727	en_US
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.issue	1-4	en_US
dc.citation.spage	47	en_US
dc.citation.epage	56	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1989AL70700001	-
dc.citation.woscount	0	-
Appears in Collections:	Articles