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

PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE

dc.citation.epage290en_US
dc.citation.spage284en_US
dc.citation.volume12en_US
dc.citation.woscount0en_US
dc.contributor.authorHSU, LHen_US
dc.contributor.authorWANG, PFen_US
dc.contributor.authorWU, CTen_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.date.accessioned2019-04-02T06:04:40Z
dc.date.available2019-04-02T06:04:40Z
dc.date.issued1992-01-01en_US
dc.identifier.issn0926-5473en_US
dc.identifier.journalALGORITHMS, SOFTWARE, ARCHITECTURE : INFORMATION PROCESSING 92, VOL 1en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/151129
dc.identifier.wosnumberWOS:A1992BX74K00038en_US
dc.language.isoen_USen_US
dc.subjectNONNUMERICAL ALGORITHMS AND PROBLEMSen_US
dc.subjectGRAPH THEORYen_US
dc.titlePARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREEen_US
dc.typeProceedings Paperen_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: