Network Expansion Problem on the Spanning Tree in Graphs

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),...

Celý popis

Podrobná bibliografia

Vydané v:	2009 WRI World Congress on Computer Science and Information Engineering : March 31, 2009-April 2, 2009 Ročník 2; s. 691 - 695
Hlavní autori:	Jianping Li, Juanping Zhu
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.03.2009
Predmet:	Algorithm design and analysis Approximation algorithms Computational complexity Computer science Costs IP networks Mathematics network expansion Polynomials spanning tree strongly Transportation Tree graphs
ISBN:	9780769535074, 0769535070
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!