标题: 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-九月-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
显示于类别:Articles


文件中的档案:

  1. A1991GM52700009.pdf

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.