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

FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS

dc.citation.epage281en_US
dc.citation.issue5en_US
dc.citation.spage277en_US
dc.citation.volume39en_US
dc.citation.woscount30
dc.contributor.authorHSU, LHen_US
dc.contributor.authorJAN, RHen_US
dc.contributor.authorLEE, YCen_US
dc.contributor.authorHUNG, CNen_US
dc.contributor.authorCHERN, MSen_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.date.accessioned2014-12-08T15:05:09Z
dc.date.available2014-12-08T15:05:09Z
dc.date.issued1991-09-13en_US
dc.identifier.doi10.1016/0020-0190(91)90028-Gen_US
dc.identifier.issn0020-0190en_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.identifier.urihttp://dx.doi.org/10.1016/0020-0190(91)90028-Gen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/3684
dc.identifier.wosnumberWOS:A1991GM52700009
dc.language.isoen_USen_US
dc.subjectDATA STRUCTURESen_US
dc.subjectDESIGN OF ALGORITHMSen_US
dc.subjectMINIMUM SPANNING TREESen_US
dc.titleFINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHSen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
A1991GM52700009.pdf
Size:
556.76 KB
Format:
Adobe Portable Document Format

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: