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

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29093

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29093

Title:	A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Authors:	Tzeng,CH;Jiang,JR;Huang,ST
Contributors:	資訊工程研究所
Keywords:	PLANAR SUBGRAPH;SYSTEMS;GRAPHS
Date:	2009
Issue Date:	2010-06-29 20:13:34 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	INFORMATION PROCESSING LETTERS
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	789	View/Open

社群 sharing