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

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

dc.citation.epage74en_US
dc.citation.issue2-4en_US
dc.citation.spage65en_US
dc.citation.volume29en_US
dc.citation.woscount0
dc.contributor.authorTSENG, SSen_US
dc.contributor.authorWANG, LRen_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.date.accessioned2014-12-08T15:05:54Z
dc.date.available2014-12-08T15:05:54Z
dc.date.issued1989en_US
dc.identifier.doi10.1080/00207168908803749en_US
dc.identifier.issn0020-7160en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMPUTER MATHEMATICSen_US
dc.identifier.urihttp://dx.doi.org/10.1080/00207168908803749en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/4431
dc.identifier.wosnumberWOS:A1989AL70700001
dc.language.isoen_USen_US
dc.titleMAXIMIZING THE NUMBER OF SPANNING-TREES OF NETWORKS BASED ON CYCLE BASIS REPRESENTATIONen_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: