標題: FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
作者: HSU, LH
JAN, RH
LEE, YC
HUNG, CN
CHERN, MS
資訊工程學系
Department of Computer Science
關鍵字: DATA STRUCTURES;DESIGN OF ALGORITHMS;MINIMUM SPANNING TREES
公開日期: 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
期刊: INFORMATION PROCESSING LETTERS
Volume: 39
Issue: 5
起始頁: 277
結束頁: 281
Appears in Collections:Articles


Files in This Item:

  1. A1991GM52700009.pdf