A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks |
scientific article; zbMATH DE number 5771252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks |
scientific article; zbMATH DE number 5771252 |
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
0.763754665851593
0 references
0.7550308108329773
0 references
0.7420631051063538
0 references
0.7383544445037842
0 references
