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

DOI10.1016/J.IPL.2009.01.013zbMATH Open1209.68385OpenAlexW2006520316MaRDI QIDQ987811FDOQ987811

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

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

Recommendations

• A self-stabilizing algorithm for coloring planar graphs
• scientific article; zbMATH DE number 871895
• Distributed edge coloration for bipartite networks
• A self-stabilizing algorithm for the maximum flow problem
• On the complexity of the maximum biplanar subgraph problem

zbMATH Keywords

bipartite graphfault toleranceplanar graphself-stabilizationspanning tree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Self-stabilizing systems in spite of distributed control
• Efficient Planarity Testing
• Easy and difficult objective functions for max cut
• Title not available (Why is that?)
• A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
• Distributed reset
• A self-stabilizing algorithm for coloring planar graphs
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
• Planarizing graphs---a survey and annotated bibliography
• Local solutions for global problems in wireless networks
• Title not available (Why is that?)
• An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem

Cited In (1)

• Distributed edge coloration for bipartite networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987811)