| Title: | FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS |
| Authors: | HSU, LH JAN, RH LEE, YC HUNG, CN CHERN, MS 資訊工程學系 Department of Computer Science |
| Keywords: | DATA STRUCTURES;DESIGN OF ALGORITHMS;MINIMUM SPANNING TREES |
| Issue Date: | 13-Sep-1991 |
| URI: | http://dx.doi.org/10.1016/0020-0190(91)90028-G http://hdl.handle.net/11536/3684 |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/0020-0190(91)90028-G |
| Journal: | INFORMATION PROCESSING LETTERS |
| Volume: | 39 |
| Issue: | 5 |
| Begin Page: | 277 |
| End Page: | 281 |
| Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.
- PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE / HSU, LH;WANG, PF;WU, CT
- PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE / HSU, LH;WANG, PF;WU, CT
- PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE / HSU, LH;WANG, PF;WU, CT
- FINDING THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES / TSEN, FSP;SUNG, TY;LIN, MY;HSU, LH;MYRVOLD, W
- PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE / HSU, LH;WANG, PF;WU, CT
Loading...