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

Full description

Bibliographic Details

Published in:	2009 WRI World Congress on Computer Science and Information Engineering : March 31, 2009-April 2, 2009 Vol. 2; pp. 691 - 695
Main Authors:	Jianping Li, Juanping Zhu
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.03.2009
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!