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

Authors:
Chi-Hung Tzeng;Jehn-Ruey Jiang;Shing-Tsaan Huang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan;Department of Computer Science and Information Engineering, National Central University, Jhongli, Taiwan;Department of Computer Science and Information Engineering, National Central University, Jhongli, Taiwan
Venue:
Information Processing Letters
Year:
2009

Citing 11
Cited 0

An O(m log n)-time algorithm for the maximal planar subgraph problem

SIAM Journal on Computing
Efficient Planarity Testing

Journal of the ACM (JACM)
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed Reset

IEEE Transactions on Computers
A self-stabilizing algorithm for coloring planar graphs

Distributed Computing - Special issue: Self-stabilization
A Linear-Time Algorithm for Finding a Maximal Planar Subgraph

SIAM Journal on Discrete Mathematics
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems

Information Processing Letters
Local solutions for global problems in wireless networks

Journal of Discrete Algorithms
Localized Delaunay triangulation with application in ad hoc wireless networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.89

Visualization

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.