| Title: | PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE |
| Authors: | HSU, LH WANG, PF WU, CT 資訊工程學系 Department of Computer Science |
| Keywords: | NONNUMERICAL ALGORITHMS AND PROBLEMS;GRAPH THEORY |
| Issue Date: | 1-Jan-1992 |
| URI: | http://hdl.handle.net/11536/151129 |
| ISSN: | 0926-5473 |
| Journal: | ALGORITHMS, SOFTWARE, ARCHITECTURE : INFORMATION PROCESSING 92, VOL 1 |
| Volume: | 12 |
| Begin Page: | 284 |
| End Page: | 290 |
| Appears in Collections: | Conferences Paper |
- PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE / HSU, LH;WANG, PF;WU, CT
- ELEMENT PERTURBATION PROBLEMS OF OPTIMUM SPANNING-TREES WITH 2-PARAMETER OBJECTIVES / CHANG, YC;HSU, LH
- FINDING THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES / TSEN, FSP;SUNG, TY;LIN, MY;HSU, LH;MYRVOLD, W
- THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS / JAN, RH;HSU, LH;LEE, YY
- FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS / HSU, LH;JAN, RH;LEE, YC;HUNG, CN;CHERN, MS
Loading...