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

DOI10.1016/j.ipl.2009.01.013zbMath1209.68385OpenAlexW2006520316MaRDI QIDQ987811

Jehn-Ruey Jiang, Shing-Tsaan Huang, Chi-Hung Tzeng

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.013

zbMATH Keywords

bipartite graphfault tolerancespanning treeplanar graphself-stabilization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
• A self-stabilizing algorithm for coloring planar graphs
• Easy and difficult objective functions for max cut
• Local solutions for global problems in wireless networks
• Planarizing Graphs - A Survey and Annotated Bibliography
• A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
• Self-stabilizing systems in spite of distributed control
• Efficient Planarity Testing
• An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
• Distributed reset

This page was built for publication: A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks