<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.epage56en_US
dc.citation.spage47en_US
dc.citation.volume28en_US
dc.citation.woscount5en_US
dc.contributor.authorTSENG, SSen_US
dc.contributor.authorWANG, LRen_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.date.accessioned2019-04-02T05:59:02Z
dc.date.available2019-04-02T05:59:02Z
dc.date.issued1989-01-01en_US
dc.identifier.doi10.1080/00207168908803727en_US
dc.identifier.issn0020-7160en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMPUTER MATHEMATICSen_US
dc.identifier.urihttp://dx.doi.org/10.1080/00207168908803727en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/149087
dc.identifier.wosnumberWOS:A1989U741200005en_US
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: