| 標題: | 在加權圖中由最小生成樹群尋找最重要的邊 Finding the most vital edge with respect to minimum spanning trees in weighted graphs |
| 作者: | 金道銘 JIN, DIAO-MING 簡榮宏 徐力行 JIAN, RONG-HONG XU, LI-XING 資訊科學與工程研究所 |
| 關鍵字: | 加權圖;最小生成樹群;最重要的邊 |
| 公開日期: | 1991 |
| URI: | http://140.113.39.130/cdrfb3/record/nctu/#NT802394017 http://hdl.handle.net/11536/55925 |
| Appears in Collections: | Thesis |
- 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
- 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
- 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...