
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
2009 WRI World Congress on Computer Science and Information Engineering
Network Expansion Problem on the Spanning Tree in Graphs
Los Angeles, California USA
March 31April 02
ISBN: 9780769535074
ASCII Text  x  
Jianping Li, Juanping Zhu, "Network Expansion Problem on the Spanning Tree in Graphs," Computer Science and Information Engineering, World Congress on, vol. 2, pp. 691695, 2009 WRI World Congress on Computer Science and Information Engineering, 2009.  
BibTex  x  
@article{ 10.1109/CSIE.2009.336, author = {Jianping Li and Juanping Zhu}, title = {Network Expansion Problem on the Spanning Tree in Graphs}, journal ={Computer Science and Information Engineering, World Congress on}, volume = {2}, year = {2009}, isbn = {9780769535074}, pages = {691695}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.336}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  Computer Science and Information Engineering, World Congress on TI  Network Expansion Problem on the Spanning Tree in Graphs SN  9780769535074 SP691 EP695 A1  Jianping Li, A1  Juanping Zhu, PY  2009 KW  spanning tree; network expansion; strongly VL  2 JA  Computer Science and Information Engineering, World Congress on ER   
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.336
Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the underlying structure of the networks unchanged. In this paper we propose the general network expansion problem on the spanning tree in graphs (GNEST), then we present the polynomial equivalence between the GNEST problem and the constrained minimum spanning tree problem (CST), which indicates the GNEST problem is NPhard. By utilizing an algorithm[5] to solve the CST problem, we can design a PTAS to solve the GNEST problem, and the computational complexity is the same as that of the algorithm given in [5]. Finally we study two special versions of the GNEST problem:the minimum network expansion on spanning tree problem(MNEST) and the minimumcost network expansion on spanning tree (MCNEST). We design two polynomialtime algorithms to solve these two new problems. To solve the MNEST problem we use Texchange method on spanning trees. To find the optimal solution of the MCNEST problem,we utilize lexicographical order and modify Sollin’s algorithm to find the minimum spanning tree as required.
Index Terms:
spanning tree; network expansion; strongly
Citation:
Jianping Li, Juanping Zhu, "Network Expansion Problem on the Spanning Tree in Graphs," csie, vol. 2, pp.691695, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.