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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distributed reset / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding a Maximal Planar Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarizing Graphs - A Survey and Annotated Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and difficult objective functions for max cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local solutions for global problems in wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311854 / rank
 
Normal rank

Revision as of 01:52, 3 July 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
    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