| 標題: | 圖形問題上最重要邊之研究 The most vital edges on some graph problems |
| 作者: | 洪春男 HONG, CHUN-NAN 徐力行 XU, LI-XING 資訊科學與工程研究所 |
| 關鍵字: | 圖形問題;最重要邊研究 |
| 公開日期: | 1991 |
| URI: | http://140.113.39.130/cdrfb3/record/nctu/#NT802394019 http://hdl.handle.net/11536/55927 |
| 顯示於類別： | 畢業論文 |
- 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
- 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 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
- PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE / HSU, LH;WANG, PF;WU, CT
Loading...