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

From MaRDI portal
Revision as of 01:52, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
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
    0 references
    0 references
    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

    Identifiers