| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427802 | Information Processing Letters | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
