A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2009.01.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2009.01.013 / rank | |||
Normal rank | |||
Latest revision as of 11:22, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks |
scientific article |
Statements
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (English)
0 references
16 August 2010
0 references
bipartite graph
0 references
fault tolerance
0 references
planar graph
0 references
self-stabilization
0 references
spanning tree
0 references
0 references
