A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29093

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29093

题名:	A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
作者:	Tzeng,CH;Jiang,JR;Huang,ST
贡献者:	資訊工程研究所
关键词:	PLANAR SUBGRAPH;SYSTEMS;GRAPHS
日期:	2009
上传时间:	2010-06-29 20:13:34 (UTC+8)
出版者:	中央大學
摘要:	The maximum planarization problem is to find a spanning planar subgraph having the largest number of edges for a given graph. In this paper, we propose a self-stabilizing algorithm to solve this problem for complete bipartite networks. The proposed algorithm finds the maximum planar subgraph of 2n-4 edges in O(n) rounds, where n is the number of nodes. (C) 2009 Elsevier B.V. All rights reserved.
關聯:	INFORMATION PROCESSING LETTERS
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	723	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing